/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-scaling/divbin2_unwindbound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:15:22,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:15:22,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:15:22,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:15:22,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:15:22,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:15:22,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:15:22,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:15:22,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:15:22,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:15:22,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:15:22,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:15:22,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:15:22,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:15:22,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:15:22,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:15:22,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:15:22,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:15:22,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:15:22,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:15:22,661 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:15:22,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:15:22,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:15:22,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:15:22,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:15:22,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:15:22,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:15:22,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:15:22,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:15:22,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:15:22,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:15:22,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:15:22,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:15:22,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:15:22,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:15:22,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:15:22,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:15:22,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:15:22,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:15:22,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:15:22,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:15:22,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:15:22,675 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 14:15:22,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:15:22,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:15:22,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:15:22,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:15:22,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:15:22,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:15:22,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:15:22,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:15:22,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:15:22,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:15:22,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:15:22,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:15:22,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:15:22,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:15:22,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:15:22,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:15:22,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:15:22,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:15:22,687 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:15:22,687 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:15:22,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:15:22,687 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:15:22,687 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 14:15:22,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:15:22,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:15:22,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:15:22,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:15:22,886 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:15:22,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-15 14:15:22,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7d86434/b2ac21671d27491c99559520cfcead4a/FLAGa366a73f1 [2022-04-15 14:15:23,300 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:15:23,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-15 14:15:23,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7d86434/b2ac21671d27491c99559520cfcead4a/FLAGa366a73f1 [2022-04-15 14:15:23,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7d86434/b2ac21671d27491c99559520cfcead4a [2022-04-15 14:15:23,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:15:23,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:15:23,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:15:23,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:15:23,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:15:23,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4659f567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23, skipping insertion in model container [2022-04-15 14:15:23,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:15:23,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:15:23,465 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-scaling/divbin2_unwindbound1.i[951,964] [2022-04-15 14:15:23,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:15:23,485 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:15:23,493 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-scaling/divbin2_unwindbound1.i[951,964] [2022-04-15 14:15:23,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:15:23,504 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:15:23,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23 WrapperNode [2022-04-15 14:15:23,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:15:23,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:15:23,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:15:23,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:15:23,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:15:23,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:15:23,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:15:23,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:15:23,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (1/1) ... [2022-04-15 14:15:23,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:15:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:15:23,548 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 14:15:23,550 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 14:15:23,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:15:23,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:15:23,570 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:15:23,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:15:23,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:15:23,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:15:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:15:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:15:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:15:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:15:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:15:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:15:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:15:23,617 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:15:23,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:15:23,755 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:15:23,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:15:23,761 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:15:23,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:15:23 BoogieIcfgContainer [2022-04-15 14:15:23,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:15:23,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:15:23,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:15:23,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:15:23,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:15:23" (1/3) ... [2022-04-15 14:15:23,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7879ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:15:23, skipping insertion in model container [2022-04-15 14:15:23,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:15:23" (2/3) ... [2022-04-15 14:15:23,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7879ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:15:23, skipping insertion in model container [2022-04-15 14:15:23,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:15:23" (3/3) ... [2022-04-15 14:15:23,774 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound1.i [2022-04-15 14:15:23,777 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:15:23,778 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:15:23,813 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:15:23,817 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 14:15:23,817 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:15:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:15:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 14:15:23,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:23,833 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:15:23,833 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-15 14:15:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:23,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457529872] [2022-04-15 14:15:23,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-15 14:15:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:23,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074945444] [2022-04-15 14:15:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:15:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:24,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-15 14:15:24,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 14:15:24,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 14:15:24,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:15:24,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-15 14:15:24,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 14:15:24,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 14:15:24,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-15 14:15:24,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-15 14:15:24,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 14:15:24,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-15 14:15:24,008 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-15 14:15:24,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 14:15:24,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 14:15:24,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 14:15:24,009 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 14:15:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:24,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074945444] [2022-04-15 14:15:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074945444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:24,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:15:24,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:24,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457529872] [2022-04-15 14:15:24,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457529872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:24,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:24,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:15:24,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831724554] [2022-04-15 14:15:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 14:15:24,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:24,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 14:15:24,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:24,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:15:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:15:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:15:24,070 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 14:15:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:24,169 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-15 14:15:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:15:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 14:15:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:15:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 14:15:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 14:15:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 14:15:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 14:15:24,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 14:15:24,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:24,255 INFO L225 Difference]: With dead ends: 44 [2022-04-15 14:15:24,255 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 14:15:24,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:15:24,260 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:15:24,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:15:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 14:15:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 14:15:24,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:15:24,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,289 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,289 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:24,294 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 14:15:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 14:15:24,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:24,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:24,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 14:15:24,296 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 14:15:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:24,300 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 14:15:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 14:15:24,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:24,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:24,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:15:24,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:15:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 14:15:24,308 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-15 14:15:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:15:24,309 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 14:15:24,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 14:15:24,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 14:15:24,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 14:15:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 14:15:24,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:24,342 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:15:24,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:15:24,342 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-15 14:15:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:24,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764108413] [2022-04-15 14:15:24,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-15 14:15:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:24,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557226243] [2022-04-15 14:15:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:24,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:15:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:24,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:15:24,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:24,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {217#(<= |main_#t~post2| 0)} is VALID [2022-04-15 14:15:24,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 1);havoc #t~post2; {212#false} is VALID [2022-04-15 14:15:24,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-15 14:15:24,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 1);havoc #t~post3; {212#false} is VALID [2022-04-15 14:15:24,464 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {212#false} is VALID [2022-04-15 14:15:24,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-15 14:15:24,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-15 14:15:24,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-15 14:15:24,464 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 14:15:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:24,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557226243] [2022-04-15 14:15:24,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557226243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:24,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:24,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:15:24,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764108413] [2022-04-15 14:15:24,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764108413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:24,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:24,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:15:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390545516] [2022-04-15 14:15:24,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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 14 [2022-04-15 14:15:24,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:24,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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 14:15:24,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:24,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:15:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:24,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:15:24,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:15:24,485 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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 14:15:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:24,588 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 14:15:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:15:24,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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 14 [2022-04-15 14:15:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:15:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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 14:15:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 14:15:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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 14:15:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 14:15:24,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 14:15:24,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:24,627 INFO L225 Difference]: With dead ends: 35 [2022-04-15 14:15:24,627 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 14:15:24,627 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 14:15:24,630 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:15:24,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:15:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 14:15:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 14:15:24,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:15:24,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,645 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,646 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:24,647 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 14:15:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 14:15:24,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:24,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:24,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 14:15:24,649 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 14:15:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:24,651 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 14:15:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 14:15:24,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:24,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:24,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:15:24,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:15:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:15:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 14:15:24,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-15 14:15:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:15:24,657 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 14:15:24,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 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 14:15:24,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 14:15:24,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 14:15:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 14:15:24,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:24,681 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:15:24,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 14:15:24,681 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:24,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-15 14:15:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:24,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644965446] [2022-04-15 14:15:24,687 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-15 14:15:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:24,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821540246] [2022-04-15 14:15:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:24,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:15:24,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381335036] [2022-04-15 14:15:24,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:15:24,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:15:24,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:15:24,727 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 14:15:24,757 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 14:15:24,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:15:24,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:15:24,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 14:15:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:24,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:15:25,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 14:15:25,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(10, 2);~counter~0 := 0; {385#true} is VALID [2022-04-15 14:15:25,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 14:15:25,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #82#return; {385#true} is VALID [2022-04-15 14:15:25,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret4 := main(); {385#true} is VALID [2022-04-15 14:15:25,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:15:25,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:15:25,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 1);havoc #t~post2; {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:15:25,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:15:25,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:15:25,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 1);havoc #t~post3; {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:15:25,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {425#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:15:25,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {425#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {429#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:15:25,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {386#false} is VALID [2022-04-15 14:15:25,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 14:15:25,154 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 14:15:25,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:15:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:25,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821540246] [2022-04-15 14:15:25,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:15:25,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381335036] [2022-04-15 14:15:25,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381335036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:25,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:25,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:15:25,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:25,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644965446] [2022-04-15 14:15:25,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644965446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:25,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:25,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:15:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116348685] [2022-04-15 14:15:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:25,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-15 14:15:25,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:25,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 14:15:25,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:25,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:15:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:15:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:15:25,174 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 14:15:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:25,323 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 14:15:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:15:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-15 14:15:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:15:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 14:15:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 14:15:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 14:15:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 14:15:25,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 14:15:25,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:25,365 INFO L225 Difference]: With dead ends: 35 [2022-04-15 14:15:25,365 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 14:15:25,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:15:25,367 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:15:25,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:15:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 14:15:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 14:15:25,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:15:25,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:15:25,388 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:15:25,388 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:15:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:25,393 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 14:15:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 14:15:25,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:25,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:25,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 14:15:25,395 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 14:15:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:25,400 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 14:15:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 14:15:25,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:25,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:25,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:15:25,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:15:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:15:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 14:15:25,402 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-15 14:15:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:15:25,402 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 14:15:25,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 14:15:25,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 14:15:25,438 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 14:15:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 14:15:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 14:15:25,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:25,442 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:15:25,460 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 14:15:25,651 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 14:15:25,652 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:25,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-15 14:15:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:25,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382360229] [2022-04-15 14:15:25,811 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:15:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1104810099, now seen corresponding path program 1 times [2022-04-15 14:15:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750095749] [2022-04-15 14:15:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:25,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:15:25,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112240447] [2022-04-15 14:15:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:25,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:15:25,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:15:25,826 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 14:15:25,827 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 14:15:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:25,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 14:15:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:25,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:15:25,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {635#true} call ULTIMATE.init(); {635#true} is VALID [2022-04-15 14:15:25,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#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(10, 2);~counter~0 := 0; {643#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:25,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#(<= ~counter~0 0)} assume true; {643#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:25,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {643#(<= ~counter~0 0)} {635#true} #82#return; {643#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:25,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {643#(<= ~counter~0 0)} call #t~ret4 := main(); {643#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:25,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {643#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {656#(and (= main_~b~0 1) (<= ~counter~0 0))} is VALID [2022-04-15 14:15:25,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(and (= main_~b~0 1) (<= ~counter~0 0))} [86] L34-3-->L34-1_primed: Formula: (let ((.cse0 (= v_main_~b~0_In_1 v_main_~b~0_Out_2))) (or (and .cse0 (= v_main_~r~0_In_1 0) (<= v_~counter~0_In_1 v_~counter~0_Out_2) (<= (mod (div v_main_~b~0_Out_2 2) 4294967296) (mod v_main_~r~0_In_1 4294967296)) (= (mod v_main_~b~0_Out_2 2) 0) (< v_~counter~0_Out_2 2) (= v_main_~b~0_Out_2 0)) (and .cse0 (= v_~counter~0_In_1 v_~counter~0_Out_2) (= v_main_~r~0_In_1 v_main_~r~0_In_1)))) InVars {~counter~0=v_~counter~0_In_1, main_~b~0=v_main_~b~0_In_1, main_~r~0=v_main_~r~0_In_1} OutVars{~counter~0=v_~counter~0_Out_2, main_#t~post2=|v_main_#t~post2_Out_2|, main_~b~0=v_main_~b~0_Out_2, main_~r~0=v_main_~r~0_In_1} AuxVars[] AssignedVars[~counter~0, main_#t~post2, main_~b~0] {643#(<= ~counter~0 0)} is VALID [2022-04-15 14:15:25,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {643#(<= ~counter~0 0)} [85] L34-1_primed-->L34-1: Formula: (and (= v_~counter~0_3 (+ |v_main_#t~post2_1| 1)) (= |v_main_#t~post2_1| v_~counter~0_4)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post2] {663#(<= |main_#t~post2| 0)} is VALID [2022-04-15 14:15:25,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#(<= |main_#t~post2| 0)} assume !(#t~post2 < 1);havoc #t~post2; {636#false} is VALID [2022-04-15 14:15:25,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {636#false} is VALID [2022-04-15 14:15:25,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#false} assume !(#t~post3 < 1);havoc #t~post3; {636#false} is VALID [2022-04-15 14:15:25,956 INFO L272 TraceCheckUtils]: 11: Hoare triple {636#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {636#false} is VALID [2022-04-15 14:15:25,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {636#false} ~cond := #in~cond; {636#false} is VALID [2022-04-15 14:15:25,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#false} assume 0 == ~cond; {636#false} is VALID [2022-04-15 14:15:25,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {636#false} assume !false; {636#false} is VALID [2022-04-15 14:15:25,957 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 14:15:25,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:15:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750095749] [2022-04-15 14:15:25,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:15:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112240447] [2022-04-15 14:15:25,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112240447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:25,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:25,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:15:26,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:26,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382360229] [2022-04-15 14:15:26,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382360229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:26,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:26,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:15:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389682388] [2022-04-15 14:15:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:26,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 3 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 17 [2022-04-15 14:15:26,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:26,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 3 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 14:15:26,010 WARN L143 InductivityCheck]: Transition 684#(and (= main_~b~0 2) (<= ~counter~0 1) (<= 1 (mod main_~r~0 4294967296))) ( _ , #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; , 663#(<= |main_#t~post2| 0) ) not inductive [2022-04-15 14:15:26,027 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 14:15:26,210 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 14:15:26,211 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 14:15:26,214 INFO L158 Benchmark]: Toolchain (without parser) took 2899.38ms. Allocated memory was 191.9MB in the beginning and 269.5MB in the end (delta: 77.6MB). Free memory was 143.1MB in the beginning and 140.8MB in the end (delta: 2.2MB). Peak memory consumption was 79.6MB. Max. memory is 8.0GB. [2022-04-15 14:15:26,214 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory was 159.1MB in the beginning and 159.0MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 14:15:26,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.38ms. Allocated memory is still 191.9MB. Free memory was 142.8MB in the beginning and 166.3MB in the end (delta: -23.5MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-15 14:15:26,215 INFO L158 Benchmark]: Boogie Preprocessor took 19.21ms. Allocated memory is still 191.9MB. Free memory was 166.3MB in the beginning and 164.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 14:15:26,215 INFO L158 Benchmark]: RCFGBuilder took 237.72ms. Allocated memory is still 191.9MB. Free memory was 164.7MB in the beginning and 153.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 14:15:26,215 INFO L158 Benchmark]: TraceAbstraction took 2446.56ms. Allocated memory was 191.9MB in the beginning and 269.5MB in the end (delta: 77.6MB). Free memory was 152.8MB in the beginning and 140.8MB in the end (delta: 12.0MB). Peak memory consumption was 90.4MB. Max. memory is 8.0GB. [2022-04-15 14:15:26,216 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.12ms. Allocated memory is still 191.9MB. Free memory was 159.1MB in the beginning and 159.0MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.38ms. Allocated memory is still 191.9MB. Free memory was 142.8MB in the beginning and 166.3MB in the end (delta: -23.5MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.21ms. Allocated memory is still 191.9MB. Free memory was 166.3MB in the beginning and 164.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 237.72ms. Allocated memory is still 191.9MB. Free memory was 164.7MB in the beginning and 153.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2446.56ms. Allocated memory was 191.9MB in the beginning and 269.5MB in the end (delta: 77.6MB). Free memory was 152.8MB in the beginning and 140.8MB in the end (delta: 12.0MB). Peak memory consumption was 90.4MB. 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 14:15:26,237 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...