/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/hard2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:30:27,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:30:27,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:30:27,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:30:27,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:30:27,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:30:27,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:30:27,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:30:27,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:30:27,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:30:27,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:30:27,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:30:27,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:30:27,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:30:27,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:30:27,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:30:27,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:30:27,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:30:27,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:30:27,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:30:27,643 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:30:27,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:30:27,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:30:27,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:30:27,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:30:27,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:30:27,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:30:27,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:30:27,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:30:27,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:30:27,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:30:27,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:30:27,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:30:27,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:30:27,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:30:27,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:30:27,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:30:27,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:30:27,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:30:27,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:30:27,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:30:27,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:30:27,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:30:27,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:30:27,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:30:27,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:30:27,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:30:27,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:30:27,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:30:27,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:30:27,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:30:27,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:30:27,669 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:30:27,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:30:27,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:30:27,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:30:27,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:30:27,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:30:27,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:30:27,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:30:27,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:30:27,671 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:30:27,671 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:30:27,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:30:27,672 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:30:27,672 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:30:27,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:30:27,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:30:27,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:30:27,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:30:27,876 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:30:27,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-15 13:30:27,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b56d2e40/d5fe703c47234d4eae9ebc3c455d7650/FLAG90ecca7d9 [2022-04-15 13:30:28,379 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:30:28,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-15 13:30:28,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b56d2e40/d5fe703c47234d4eae9ebc3c455d7650/FLAG90ecca7d9 [2022-04-15 13:30:28,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b56d2e40/d5fe703c47234d4eae9ebc3c455d7650 [2022-04-15 13:30:28,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:30:28,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:30:28,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:30:28,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:30:28,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:30:28,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:28" (1/1) ... [2022-04-15 13:30:28,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1960483e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:28, skipping insertion in model container [2022-04-15 13:30:28,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:28" (1/1) ... [2022-04-15 13:30:28,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:30:28,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:30:29,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c[526,539] [2022-04-15 13:30:29,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:30:29,054 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:30:29,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c[526,539] [2022-04-15 13:30:29,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:30:29,099 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:30:29,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29 WrapperNode [2022-04-15 13:30:29,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:30:29,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:30:29,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:30:29,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:30:29,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:30:29,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:30:29,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:30:29,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:30:29,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (1/1) ... [2022-04-15 13:30:29,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:30:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:29,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:30:29,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:30:29,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:30:29,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:30:29,222 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:30:29,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:30:29,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:30:29,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:30:29,223 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:30:29,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:30:29,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:30:29,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:30:29,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:30:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:30:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:30:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:30:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:30:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:30:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:30:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:30:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:30:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:30:29,284 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:30:29,286 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:30:29,454 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:30:29,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:30:29,461 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:30:29,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:29 BoogieIcfgContainer [2022-04-15 13:30:29,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:30:29,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:30:29,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:30:29,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:30:29,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:30:28" (1/3) ... [2022-04-15 13:30:29,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c026538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:29, skipping insertion in model container [2022-04-15 13:30:29,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:29" (2/3) ... [2022-04-15 13:30:29,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c026538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:29, skipping insertion in model container [2022-04-15 13:30:29,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:29" (3/3) ... [2022-04-15 13:30:29,484 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2.c [2022-04-15 13:30:29,488 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:30:29,488 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:30:29,530 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:30:29,543 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:30:29,543 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:30:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:30:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:30:29,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:29,565 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:30:29,566 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 1 times [2022-04-15 13:30:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:29,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1512585610] [2022-04-15 13:30:29,586 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:30:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 2 times [2022-04-15 13:30:29,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:29,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384369013] [2022-04-15 13:30:29,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:30:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:29,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 13:30:29,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 13:30:29,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-15 13:30:29,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:30:29,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 13:30:29,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 13:30:29,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-15 13:30:29,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-15 13:30:29,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {37#(= main_~q~0 0)} is VALID [2022-04-15 13:30:29,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~q~0 0)} assume !false; {37#(= main_~q~0 0)} is VALID [2022-04-15 13:30:29,798 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:30:29,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:30:29,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-15 13:30:29,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 13:30:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:30:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384369013] [2022-04-15 13:30:29,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384369013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:29,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:29,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:30:29,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1512585610] [2022-04-15 13:30:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1512585610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:29,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:29,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:30:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845570388] [2022-04-15 13:30:29,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:29,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:30:29,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:29,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:30:29,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:29,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:30:29,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:29,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:30:29,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:30:29,849 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:30:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:30,355 INFO L93 Difference]: Finished difference Result 66 states and 111 transitions. [2022-04-15 13:30:30,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:30:30,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:30:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:30:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:30:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 13:30:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:30:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 13:30:30,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-15 13:30:30,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:30,509 INFO L225 Difference]: With dead ends: 66 [2022-04-15 13:30:30,509 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 13:30:30,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:30:30,515 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:30:30,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:30:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 13:30:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-15 13:30:30,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:30:30,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:30,546 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:30,547 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:30,552 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 13:30:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 13:30:30,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:30,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:30,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-15 13:30:30,554 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-15 13:30:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:30,558 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 13:30:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 13:30:30,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:30,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:30,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:30:30,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:30:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-15 13:30:30,563 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2022-04-15 13:30:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:30:30,563 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-15 13:30:30,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:30:30,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-15 13:30:30,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 13:30:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:30:30,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:30,608 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:30:30,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:30:30,609 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 1 times [2022-04-15 13:30:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:30,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144378328] [2022-04-15 13:30:30,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:30:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 2 times [2022-04-15 13:30:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:30,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597546493] [2022-04-15 13:30:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:30,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:30:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:30,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-15 13:30:30,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 13:30:30,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-15 13:30:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 13:30:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:30,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-15 13:30:30,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-15 13:30:30,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 13:30:30,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 13:30:30,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:30:30,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-15 13:30:30,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 13:30:30,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-15 13:30:30,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2022-04-15 13:30:30,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 13:30:30,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#(= main_~A~0 main_~r~0)} assume !false; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 13:30:30,688 INFO L272 TraceCheckUtils]: 7: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {309#true} is VALID [2022-04-15 13:30:30,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-15 13:30:30,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-15 13:30:30,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 13:30:30,690 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 13:30:30,690 INFO L272 TraceCheckUtils]: 12: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:30:30,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {320#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:30:30,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {310#false} is VALID [2022-04-15 13:30:30,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-15 13:30:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:30:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:30,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597546493] [2022-04-15 13:30:30,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597546493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:30,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:30,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:30:30,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:30,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144378328] [2022-04-15 13:30:30,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144378328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:30,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:30,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:30:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57851349] [2022-04-15 13:30:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:30,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-15 13:30:30,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:30,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:30:30,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:30,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:30:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:30,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:30:30,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:30:30,717 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:30:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:31,116 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 13:30:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:30:31,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-15 13:30:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:30:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:30:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:30:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:30:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:30:31,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 13:30:31,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:31,184 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:30:31,184 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 13:30:31,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:30:31,187 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:30:31,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:30:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 13:30:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-04-15 13:30:31,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:30:31,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:31,197 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:31,197 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:31,200 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 13:30:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-15 13:30:31,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:31,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:31,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-15 13:30:31,202 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-15 13:30:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:31,205 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 13:30:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-15 13:30:31,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:31,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:31,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:30:31,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:30:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 13:30:31,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2022-04-15 13:30:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:30:31,209 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 13:30:31,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:30:31,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 13:30:31,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 13:30:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:30:31,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:31,255 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:30:31,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:30:31,255 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 1 times [2022-04-15 13:30:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728319657] [2022-04-15 13:30:31,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:30:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 2 times [2022-04-15 13:30:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:31,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779305782] [2022-04-15 13:30:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:31,269 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:30:31,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009578544] [2022-04-15 13:30:31,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:30:31,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:31,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:30:31,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:30:31,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:30:31,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:30:31,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:30:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:31,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:30:31,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} call ULTIMATE.init(); {556#true} is VALID [2022-04-15 13:30:31,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {556#true} is VALID [2022-04-15 13:30:31,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-15 13:30:31,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} #90#return; {556#true} is VALID [2022-04-15 13:30:31,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} call #t~ret5 := main(); {556#true} is VALID [2022-04-15 13:30:31,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:31,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:31,629 INFO L272 TraceCheckUtils]: 7: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {556#true} is VALID [2022-04-15 13:30:31,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-15 13:30:31,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-15 13:30:31,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-15 13:30:31,631 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:31,631 INFO L272 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {556#true} is VALID [2022-04-15 13:30:31,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-15 13:30:31,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-15 13:30:31,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-15 13:30:31,633 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:31,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {613#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:30:31,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {613#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {617#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:30:31,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {617#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {557#false} is VALID [2022-04-15 13:30:31,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#false} assume !false; {557#false} is VALID [2022-04-15 13:30:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:30:31,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:30:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:31,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779305782] [2022-04-15 13:30:31,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:30:31,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009578544] [2022-04-15 13:30:31,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009578544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:31,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:31,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:30:31,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:31,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728319657] [2022-04-15 13:30:31,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728319657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:31,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:31,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:30:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571382311] [2022-04-15 13:30:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-15 13:30:31,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:31,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:30:31,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:31,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:30:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:31,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:30:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:30:31,656 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:30:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:31,840 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-15 13:30:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:30:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-15 13:30:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:30:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:30:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 13:30:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:30:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 13:30:31,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-15 13:30:31,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:31,924 INFO L225 Difference]: With dead ends: 60 [2022-04-15 13:30:31,924 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 13:30:31,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:30:31,932 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:30:31,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:30:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 13:30:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 13:30:31,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:30:31,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 13:30:31,953 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 13:30:31,954 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 13:30:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:31,957 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 13:30:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 13:30:31,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:31,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:31,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 46 states. [2022-04-15 13:30:31,959 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 46 states. [2022-04-15 13:30:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:31,962 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 13:30:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 13:30:31,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:31,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:31,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:30:31,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:30:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 13:30:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-04-15 13:30:31,973 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 21 [2022-04-15 13:30:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:30:31,974 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-04-15 13:30:31,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:30:31,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 57 transitions. [2022-04-15 13:30:32,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 13:30:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:30:32,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:32,052 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:30:32,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:30:32,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:32,277 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 1 times [2022-04-15 13:30:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:32,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [652145267] [2022-04-15 13:30:32,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:30:32,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 2 times [2022-04-15 13:30:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:32,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986634369] [2022-04-15 13:30:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:32,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:30:32,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878810778] [2022-04-15 13:30:32,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:30:32,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:32,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:30:32,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:30:32,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:30:32,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:30:32,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:30:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:32,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:30:32,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-15 13:30:32,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {929#true} is VALID [2022-04-15 13:30:32,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 13:30:32,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #90#return; {929#true} is VALID [2022-04-15 13:30:32,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret5 := main(); {929#true} is VALID [2022-04-15 13:30:32,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:30:32,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:30:32,531 INFO L272 TraceCheckUtils]: 7: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {929#true} is VALID [2022-04-15 13:30:32,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-15 13:30:32,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-15 13:30:32,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 13:30:32,532 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #76#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:30:32,532 INFO L272 TraceCheckUtils]: 12: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {929#true} is VALID [2022-04-15 13:30:32,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-15 13:30:32,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-15 13:30:32,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 13:30:32,534 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:30:32,534 INFO L272 TraceCheckUtils]: 17: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {929#true} is VALID [2022-04-15 13:30:32,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-15 13:30:32,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-15 13:30:32,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 13:30:32,535 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:30:32,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:30:32,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:30:32,537 INFO L272 TraceCheckUtils]: 24: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:30:32,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:30:32,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-15 13:30:32,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-15 13:30:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:30:32,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:30:32,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:32,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986634369] [2022-04-15 13:30:32,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:30:32,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878810778] [2022-04-15 13:30:32,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878810778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:32,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:32,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:30:32,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:32,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [652145267] [2022-04-15 13:30:32,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [652145267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:32,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:32,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:30:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596216914] [2022-04-15 13:30:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 13:30:32,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:32,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:32,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:32,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:30:32,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:30:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:30:32,563 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:32,752 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-04-15 13:30:32,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:30:32,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 13:30:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:30:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-15 13:30:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-15 13:30:32,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-15 13:30:32,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:32,817 INFO L225 Difference]: With dead ends: 59 [2022-04-15 13:30:32,817 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:30:32,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:30:32,819 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:30:32,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:30:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:30:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-15 13:30:32,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:30:32,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:30:32,861 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:30:32,862 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:30:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:32,865 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-15 13:30:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-15 13:30:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:32,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:32,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-15 13:30:32,867 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-15 13:30:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:32,869 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-15 13:30:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-15 13:30:32,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:32,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:32,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:30:32,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:30:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:30:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-15 13:30:32,874 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2022-04-15 13:30:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:30:32,874 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-15 13:30:32,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:32,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-15 13:30:32,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 13:30:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 13:30:32,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:32,939 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:30:32,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 13:30:33,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 13:30:33,156 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 1 times [2022-04-15 13:30:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:33,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358026774] [2022-04-15 13:30:37,558 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:30:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2021970426, now seen corresponding path program 1 times [2022-04-15 13:30:37,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:37,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602324374] [2022-04-15 13:30:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:37,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:30:37,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868263896] [2022-04-15 13:30:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:37,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:37,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:30:37,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:30:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:30:37,613 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:30:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:30:37,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:30:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 2 times [2022-04-15 13:30:37,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:37,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129880782] [2022-04-15 13:30:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:37,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:30:37,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726252713] [2022-04-15 13:30:37,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:30:37,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:37,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:37,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:30:37,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 13:30:37,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:30:37,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:30:37,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 13:30:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:37,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:30:38,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-15 13:30:38,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-15 13:30:38,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-15 13:30:38,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-15 13:30:38,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:38,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:38,047 INFO L272 TraceCheckUtils]: 7: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,049 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:38,049 INFO L272 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,053 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:38,053 INFO L272 TraceCheckUtils]: 17: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,054 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:38,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 13:30:38,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !false; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 13:30:38,056 INFO L272 TraceCheckUtils]: 24: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,058 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #76#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 13:30:38,058 INFO L272 TraceCheckUtils]: 29: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,075 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 13:30:38,076 INFO L272 TraceCheckUtils]: 34: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:30:38,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:30:38,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-15 13:30:38,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-15 13:30:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 13:30:38,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:30:38,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-15 13:30:38,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-15 13:30:38,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:30:38,258 INFO L272 TraceCheckUtils]: 34: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:30:38,258 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,259 INFO L272 TraceCheckUtils]: 29: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,260 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,260 INFO L272 TraceCheckUtils]: 24: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,266 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,266 INFO L272 TraceCheckUtils]: 17: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,267 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,268 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 13:30:38,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 13:30:38,269 INFO L272 TraceCheckUtils]: 7: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 13:30:38,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 13:30:38,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-15 13:30:38,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-15 13:30:38,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 13:30:38,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-15 13:30:38,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-15 13:30:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 13:30:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:38,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129880782] [2022-04-15 13:30:38,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:30:38,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726252713] [2022-04-15 13:30:38,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726252713] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 13:30:38,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:30:38,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 13:30:38,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358026774] [2022-04-15 13:30:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358026774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:38,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:38,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:30:38,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126957711] [2022-04-15 13:30:38,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:38,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-15 13:30:38,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:38,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:38,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:38,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:30:38,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:30:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:30:38,293 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:40,629 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-15 13:30:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:30:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-15 13:30:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:30:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 13:30:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 13:30:40,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 13:30:40,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:40,683 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:30:40,683 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 13:30:40,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:30:40,684 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:30:40,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:30:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 13:30:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-04-15 13:30:40,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:30:40,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 13:30:40,724 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 13:30:40,725 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 13:30:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:40,730 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-15 13:30:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-15 13:30:40,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:40,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:40,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-15 13:30:40,735 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-15 13:30:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:40,739 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-15 13:30:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-15 13:30:40,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:40,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:40,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:30:40,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:30:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 13:30:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-15 13:30:40,744 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2022-04-15 13:30:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:30:40,745 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-15 13:30:40,745 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:30:40,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 71 transitions. [2022-04-15 13:30:40,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-15 13:30:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 13:30:40,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:40,846 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:30:40,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 13:30:41,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:30:41,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:41,247 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -697745896, now seen corresponding path program 1 times [2022-04-15 13:30:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821025576] [2022-04-15 13:30:45,647 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:30:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash -569598471, now seen corresponding path program 1 times [2022-04-15 13:30:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:45,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102479426] [2022-04-15 13:30:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:45,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:30:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472766279] [2022-04-15 13:30:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:45,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:45,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:45,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:30:45,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 13:30:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:45,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:30:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:45,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:30:45,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 13:30:45,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-15 13:30:45,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 13:30:45,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #90#return; {1943#true} is VALID [2022-04-15 13:30:45,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret5 := main(); {1943#true} is VALID [2022-04-15 13:30:45,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1963#(and (<= 1 main_~B~0) (= main_~p~0 1))} is VALID [2022-04-15 13:30:45,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(and (<= 1 main_~B~0) (= main_~p~0 1))} [96] L33-2-->L34_primed: Formula: (or (and (= v_main_~p~0_In_2 v_main_~p~0_Out_4) (= v_main_~A~0_In_2 v_main_~A~0_In_2) (= v_main_~q~0_In_2 v_main_~q~0_In_2) (= v_main_~B~0_In_2 v_main_~B~0_In_2) (= v_main_~r~0_In_2 v_main_~r~0_In_2)) (let ((.cse0 (* (div v_main_~p~0_Out_4 2) v_main_~B~0_In_2))) (and (= v_main_~q~0_In_2 0) (= v_main_~p~0_Out_4 v_main_~p~0_In_2) (= v_main_~r~0_In_2 0) (= v_main_~d~0_Out_4 (* 2 .cse0)) (= v_main_~B~0_In_2 0) (<= .cse0 v_main_~r~0_In_2) (= v_main_~p~0_Out_4 0) (= v_main_~r~0_In_2 v_main_~A~0_In_2) (= v_main_~A~0_In_2 0) (= (mod v_main_~p~0_Out_4 2) 0)))) InVars {main_~q~0=v_main_~q~0_In_2, main_~B~0=v_main_~B~0_In_2, main_~A~0=v_main_~A~0_In_2, main_~p~0=v_main_~p~0_In_2, main_~r~0=v_main_~r~0_In_2} OutVars{main_~q~0=v_main_~q~0_In_2, main_~d~0=v_main_~d~0_Out_4, main_~B~0=v_main_~B~0_In_2, main_~A~0=v_main_~A~0_In_2, main_~p~0=v_main_~p~0_Out_4, main_~r~0=v_main_~r~0_In_2} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1967#(= main_~p~0 1)} [95] L34_primed-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,839 INFO L272 TraceCheckUtils]: 8: Hoare triple {1967#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-15 13:30:45,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 13:30:45,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 13:30:45,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 13:30:45,840 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1943#true} {1967#(= main_~p~0 1)} #76#return; {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,840 INFO L272 TraceCheckUtils]: 13: Hoare triple {1967#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-15 13:30:45,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 13:30:45,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 13:30:45,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 13:30:45,841 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1943#true} {1967#(= main_~p~0 1)} #78#return; {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,841 INFO L272 TraceCheckUtils]: 18: Hoare triple {1967#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-15 13:30:45,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 13:30:45,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 13:30:45,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 13:30:45,843 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1943#true} {1967#(= main_~p~0 1)} #80#return; {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {1967#(= main_~p~0 1)} assume !(~r~0 >= ~d~0); {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {1967#(= main_~p~0 1)} assume !false; {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,846 INFO L272 TraceCheckUtils]: 25: Hoare triple {1967#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1943#true} is VALID [2022-04-15 13:30:45,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 13:30:45,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 13:30:45,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 13:30:45,847 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1943#true} {1967#(= main_~p~0 1)} #82#return; {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,848 INFO L272 TraceCheckUtils]: 30: Hoare triple {1967#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-15 13:30:45,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 13:30:45,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 13:30:45,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 13:30:45,849 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1943#true} {1967#(= main_~p~0 1)} #84#return; {1967#(= main_~p~0 1)} is VALID [2022-04-15 13:30:45,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {1967#(= main_~p~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {1944#false} is VALID [2022-04-15 13:30:45,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {1944#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {1944#false} is VALID [2022-04-15 13:30:45,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 13:30:45,849 INFO L272 TraceCheckUtils]: 38: Hoare triple {1944#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1944#false} is VALID [2022-04-15 13:30:45,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 13:30:45,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 13:30:45,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 13:30:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 13:30:45,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:30:45,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:45,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102479426] [2022-04-15 13:30:45,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:30:45,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472766279] [2022-04-15 13:30:45,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472766279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:45,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:45,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:30:52,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:52,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821025576] [2022-04-15 13:30:52,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821025576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:52,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:52,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:30:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733007099] [2022-04-15 13:30:52,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 6 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 58 [2022-04-15 13:30:52,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:52,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 6 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 13:30:52,046 WARN L143 InductivityCheck]: Transition 2076#(and (= (* 2 (* main_~B~0 (div main_~p~0 2))) main_~d~0) (= (mod main_~p~0 2) 0) (<= (* main_~B~0 (div main_~p~0 2)) main_~r~0)) ( _ , assume !false; , 1967#(= main_~p~0 1) ) not inductive [2022-04-15 13:30:52,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:30:52,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:52,248 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:30:52,251 INFO L158 Benchmark]: Toolchain (without parser) took 23439.19ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 135.2MB in the beginning and 195.7MB in the end (delta: -60.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:30:52,251 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 183.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:30:52,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.19ms. Allocated memory is still 183.5MB. Free memory was 134.9MB in the beginning and 161.1MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:30:52,252 INFO L158 Benchmark]: Boogie Preprocessor took 46.65ms. Allocated memory is still 183.5MB. Free memory was 161.1MB in the beginning and 159.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:30:52,252 INFO L158 Benchmark]: RCFGBuilder took 314.67ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 148.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:30:52,252 INFO L158 Benchmark]: TraceAbstraction took 22785.46ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 147.9MB in the beginning and 195.7MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:30:52,253 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 183.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.19ms. Allocated memory is still 183.5MB. Free memory was 134.9MB in the beginning and 161.1MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.65ms. Allocated memory is still 183.5MB. Free memory was 161.1MB in the beginning and 159.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 314.67ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 148.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22785.46ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 147.9MB in the beginning and 195.7MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:30:52,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...