/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/ddlm2013.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:54:29,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:54:29,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:54:29,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:54:29,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:54:29,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:54:29,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:54:29,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:54:29,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:54:29,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:54:29,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:54:29,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:54:29,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:54:29,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:54:29,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:54:29,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:54:29,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:54:29,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:54:29,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:54:29,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:54:29,162 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:54:29,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:54:29,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:54:29,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:54:29,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:54:29,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:54:29,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:54:29,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:54:29,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:54:29,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:54:29,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:54:29,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:54:29,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:54:29,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:54:29,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:54:29,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:54:29,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:54:29,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:54:29,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:54:29,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:54:29,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:54:29,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:54:29,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:54:29,186 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:54:29,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:54:29,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:54:29,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:54:29,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:54:29,189 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:54:29,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:54:29,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:54:29,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:54:29,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:54:29,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:54:29,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:54:29,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:54:29,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:54:29,190 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:54:29,190 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:54:29,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:54:29,190 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:54:29,190 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-08 03:54:29,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:54:29,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:54:29,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:54:29,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:54:29,369 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:54:29,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-08 03:54:29,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a38c06d/30bd5245d040497996931ee4ccd314a2/FLAG1ddb57eff [2022-04-08 03:54:29,784 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:54:29,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-08 03:54:29,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a38c06d/30bd5245d040497996931ee4ccd314a2/FLAG1ddb57eff [2022-04-08 03:54:29,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a38c06d/30bd5245d040497996931ee4ccd314a2 [2022-04-08 03:54:29,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:54:29,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:54:29,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:54:29,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:54:29,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:54:29,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:29,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b809987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29, skipping insertion in model container [2022-04-08 03:54:29,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:29,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:54:29,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:54:29,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-04-08 03:54:29,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:54:29,955 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:54:29,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-04-08 03:54:29,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:54:29,974 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:54:29,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29 WrapperNode [2022-04-08 03:54:29,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:54:29,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:54:29,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:54:29,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:54:29,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:29,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:29,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:29,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:29,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:30,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:30,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:30,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:54:30,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:54:30,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:54:30,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:54:30,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (1/1) ... [2022-04-08 03:54:30,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:54:30,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:30,030 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-08 03:54:30,043 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-08 03:54:30,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:54:30,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:54:30,061 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:54:30,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:54:30,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:54:30,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:54:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:54:30,116 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:54:30,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:54:30,245 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:54:30,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:54:30,250 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:54:30,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:54:30 BoogieIcfgContainer [2022-04-08 03:54:30,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:54:30,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:54:30,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:54:30,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:54:30,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:54:29" (1/3) ... [2022-04-08 03:54:30,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b21112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:54:30, skipping insertion in model container [2022-04-08 03:54:30,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:29" (2/3) ... [2022-04-08 03:54:30,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b21112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:54:30, skipping insertion in model container [2022-04-08 03:54:30,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:54:30" (3/3) ... [2022-04-08 03:54:30,263 INFO L111 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2022-04-08 03:54:30,270 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:54:30,270 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:54:30,320 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:54:30,329 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-08 03:54:30,329 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:54:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:54:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:54:30,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:30,346 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:30,346 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 1 times [2022-04-08 03:54:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:30,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451703962] [2022-04-08 03:54:30,363 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 2 times [2022-04-08 03:54:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:30,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705803315] [2022-04-08 03:54:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:30,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:30,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-08 03:54:30,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:54:30,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-08 03:54:30,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:30,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-08 03:54:30,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:54:30,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-08 03:54:30,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-08 03:54:30,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {26#true} is VALID [2022-04-08 03:54:30,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume 0 != ~flag~0;~i~0 := 0; {26#true} is VALID [2022-04-08 03:54:30,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 03:54:30,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 != ~flag~0; {27#false} is VALID [2022-04-08 03:54:30,551 INFO L272 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-08 03:54:30,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 03:54:30,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 03:54:30,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 03:54:30,552 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-08 03:54:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:30,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705803315] [2022-04-08 03:54:30,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705803315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:30,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:30,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:54:30,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:30,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451703962] [2022-04-08 03:54:30,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451703962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:30,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:30,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:54:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38968686] [2022-04-08 03:54:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-08 03:54:30,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:30,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 03:54:30,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:30,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:54:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:30,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:54:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:54:30,623 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 03:54:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:30,732 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 03:54:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:54:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-08 03:54:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 03:54:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-08 03:54:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 03:54:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-08 03:54:30,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-08 03:54:30,837 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-08 03:54:30,846 INFO L225 Difference]: With dead ends: 36 [2022-04-08 03:54:30,846 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 03:54:30,849 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-08 03:54:30,853 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:30,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:54:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 03:54:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 03:54:30,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:30,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:54:30,880 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:54:30,881 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:54:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:30,883 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 03:54:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 03:54:30,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:30,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:30,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) Second operand 16 states. [2022-04-08 03:54:30,884 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) Second operand 16 states. [2022-04-08 03:54:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:30,886 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 03:54:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 03:54:30,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:30,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:30,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:30,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:54:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 03:54:30,892 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-08 03:54:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:30,892 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 03:54:30,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 03:54:30,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 03:54:30,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 03:54:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:54:30,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:30,914 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:30,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:54:30,915 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 1 times [2022-04-08 03:54:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [271058702] [2022-04-08 03:54:30,918 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 2 times [2022-04-08 03:54:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:30,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767752290] [2022-04-08 03:54:30,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:30,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {170#true} is VALID [2022-04-08 03:54:31,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-08 03:54:31,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-08 03:54:31,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:31,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {170#true} is VALID [2022-04-08 03:54:31,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-08 03:54:31,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-08 03:54:31,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret5 := main(); {170#true} is VALID [2022-04-08 03:54:31,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {170#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:31,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:31,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:31,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:31,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume 0 != ~flag~0; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:31,059 INFO L272 TraceCheckUtils]: 10: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {176#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:31,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {177#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:31,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {177#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {171#false} is VALID [2022-04-08 03:54:31,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-04-08 03:54:31,060 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-08 03:54:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767752290] [2022-04-08 03:54:31,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767752290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:31,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:31,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:54:31,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:31,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [271058702] [2022-04-08 03:54:31,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [271058702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:31,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:31,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:54:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100420358] [2022-04-08 03:54:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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-08 03:54:31,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:31,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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-08 03:54:31,096 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-08 03:54:31,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:54:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:54:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:54:31,097 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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-08 03:54:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:31,231 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 03:54:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:54:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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-08 03:54:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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-08 03:54:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-08 03:54:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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-08 03:54:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-08 03:54:31,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-08 03:54:31,257 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-08 03:54:31,258 INFO L225 Difference]: With dead ends: 24 [2022-04-08 03:54:31,258 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 03:54:31,258 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:54:31,259 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:31,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:54:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 03:54:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 03:54:31,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:31,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-08 03:54:31,264 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-08 03:54:31,264 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-08 03:54:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:31,265 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 03:54:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:54:31,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:31,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:31,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) Second operand 18 states. [2022-04-08 03:54:31,266 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) Second operand 18 states. [2022-04-08 03:54:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:31,267 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 03:54:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:54:31,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:31,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:31,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:31,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-08 03:54:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 03:54:31,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-08 03:54:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:31,269 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 03:54:31,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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-08 03:54:31,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 03:54:31,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:54:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:54:31,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:31,286 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:31,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:54:31,287 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:31,287 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 1 times [2022-04-08 03:54:31,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:31,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418767175] [2022-04-08 03:54:31,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 2 times [2022-04-08 03:54:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:31,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964481152] [2022-04-08 03:54:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {307#true} is VALID [2022-04-08 03:54:31,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 03:54:31,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-08 03:54:31,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:31,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {307#true} is VALID [2022-04-08 03:54:31,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 03:54:31,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-08 03:54:31,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-08 03:54:31,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:31,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:31,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:31,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {314#(and (= (+ (- 1) main_~j~0) 0) (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:31,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(and (= (+ (- 1) main_~j~0) 0) (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:31,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:31,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:31,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:31,631 INFO L272 TraceCheckUtils]: 13: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {316#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:31,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {316#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {317#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:31,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {317#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {308#false} is VALID [2022-04-08 03:54:31,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-08 03:54:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:31,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:31,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964481152] [2022-04-08 03:54:31,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964481152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:31,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736755428] [2022-04-08 03:54:31,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:31,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:31,637 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-08 03:54:31,641 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-08 03:54:31,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:31,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:31,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 03:54:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:31,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:31,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-08 03:54:31,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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(9, 2); {307#true} is VALID [2022-04-08 03:54:31,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 03:54:31,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-08 03:54:31,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-08 03:54:31,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:31,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:31,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:31,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-08 03:54:31,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-08 03:54:31,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-08 03:54:31,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-08 03:54:31,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume 0 != ~flag~0; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-08 03:54:31,915 INFO L272 TraceCheckUtils]: 13: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:31,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:31,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-08 03:54:31,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-08 03:54:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:31,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:32,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-08 03:54:32,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-08 03:54:32,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:32,096 INFO L272 TraceCheckUtils]: 13: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:32,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:32,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:32,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:32,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:32,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:32,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:32,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:32,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {405#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0) 4294967296))} is VALID [2022-04-08 03:54:32,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-08 03:54:32,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-08 03:54:32,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 03:54:32,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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(9, 2); {307#true} is VALID [2022-04-08 03:54:32,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-08 03:54:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:32,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736755428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:54:32,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:54:32,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-08 03:54:32,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:32,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1418767175] [2022-04-08 03:54:32,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1418767175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:32,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:32,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:54:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096246868] [2022-04-08 03:54:32,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2022-04-08 03:54:32,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:32,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-08 03:54:32,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:32,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:54:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:32,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:54:32,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:54:32,119 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-08 03:54:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:32,395 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 03:54:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:54:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2022-04-08 03:54:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-08 03:54:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-08 03:54:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-08 03:54:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-08 03:54:32,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-08 03:54:32,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:32,450 INFO L225 Difference]: With dead ends: 29 [2022-04-08 03:54:32,451 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 03:54:32,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-04-08 03:54:32,452 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:32,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 36 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:54:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 03:54:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-08 03:54:32,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:32,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-08 03:54:32,465 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-08 03:54:32,465 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-08 03:54:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:32,466 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 03:54:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 03:54:32,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:32,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:32,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) Second operand 23 states. [2022-04-08 03:54:32,467 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) Second operand 23 states. [2022-04-08 03:54:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:32,468 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 03:54:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 03:54:32,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:32,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:32,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:32,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-08 03:54:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-08 03:54:32,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-04-08 03:54:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:32,470 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-08 03:54:32,470 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-08 03:54:32,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-08 03:54:32,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 03:54:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:54:32,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:32,492 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:32,527 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-08 03:54:32,693 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-08 03:54:32,693 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 1 times [2022-04-08 03:54:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:32,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997819351] [2022-04-08 03:54:32,694 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 2 times [2022-04-08 03:54:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:32,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467856425] [2022-04-08 03:54:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:32,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {584#true} is VALID [2022-04-08 03:54:32,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-08 03:54:32,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-08 03:54:32,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {584#true} call ULTIMATE.init(); {590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:32,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {584#true} is VALID [2022-04-08 03:54:32,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-08 03:54:32,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-08 03:54:32,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#true} call #t~ret5 := main(); {584#true} is VALID [2022-04-08 03:54:32,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {584#true} is VALID [2022-04-08 03:54:32,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} assume !(0 != ~flag~0);~i~0 := 1; {589#(= main_~flag~0 0)} is VALID [2022-04-08 03:54:32,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(= main_~flag~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {589#(= main_~flag~0 0)} is VALID [2022-04-08 03:54:32,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(= main_~flag~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {589#(= main_~flag~0 0)} is VALID [2022-04-08 03:54:32,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#(= main_~flag~0 0)} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {589#(= main_~flag~0 0)} is VALID [2022-04-08 03:54:32,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {589#(= main_~flag~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {589#(= main_~flag~0 0)} is VALID [2022-04-08 03:54:32,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#(= main_~flag~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {589#(= main_~flag~0 0)} is VALID [2022-04-08 03:54:32,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#(= main_~flag~0 0)} assume 0 != ~flag~0; {585#false} is VALID [2022-04-08 03:54:32,756 INFO L272 TraceCheckUtils]: 13: Hoare triple {585#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {585#false} is VALID [2022-04-08 03:54:32,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {585#false} ~cond := #in~cond; {585#false} is VALID [2022-04-08 03:54:32,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#false} assume 0 == ~cond; {585#false} is VALID [2022-04-08 03:54:32,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-04-08 03:54:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 03:54:32,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:32,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467856425] [2022-04-08 03:54:32,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467856425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:32,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:32,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:54:32,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997819351] [2022-04-08 03:54:32,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997819351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:32,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:32,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:54:32,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799544554] [2022-04-08 03:54:32,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17 [2022-04-08 03:54:32,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:32,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 03:54:32,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:32,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:54:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:32,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:54:32,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:54:32,770 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 03:54:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:32,833 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-08 03:54:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:54:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17 [2022-04-08 03:54:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 03:54:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 03:54:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 03:54:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 03:54:32,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-08 03:54:32,863 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-08 03:54:32,864 INFO L225 Difference]: With dead ends: 32 [2022-04-08 03:54:32,864 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 03:54:32,865 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:54:32,867 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:32,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:54:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 03:54:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 03:54:32,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:32,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 03:54:32,885 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 03:54:32,885 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 03:54:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:32,889 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-08 03:54:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 03:54:32,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:32,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:32,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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) Second operand 21 states. [2022-04-08 03:54:32,891 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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) Second operand 21 states. [2022-04-08 03:54:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:32,893 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-08 03:54:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 03:54:32,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:32,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:32,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:32,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 03:54:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-08 03:54:32,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-08 03:54:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:32,904 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-08 03:54:32,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 03:54:32,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-08 03:54:32,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 03:54:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:54:32,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:32,931 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:32,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 03:54:32,932 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 3 times [2022-04-08 03:54:32,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:32,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1069339118] [2022-04-08 03:54:32,933 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 4 times [2022-04-08 03:54:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:32,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430662279] [2022-04-08 03:54:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:33,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {743#true} is VALID [2022-04-08 03:54:33,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-08 03:54:33,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-08 03:54:33,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:33,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {743#true} is VALID [2022-04-08 03:54:33,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-08 03:54:33,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-08 03:54:33,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-08 03:54:33,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:33,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:33,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:33,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {750#(and (<= (+ main_~b~0 3) (+ main_~i~0 main_~a~0 main_~j~0)) (<= (+ main_~i~0 main_~a~0 main_~j~0) (+ main_~b~0 3)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-08 03:54:33,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {750#(and (<= (+ main_~b~0 3) (+ main_~i~0 main_~a~0 main_~j~0)) (<= (+ main_~i~0 main_~a~0 main_~j~0) (+ main_~b~0 3)) (= (+ (- 1) main_~j~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-08 03:54:33,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-08 03:54:33,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:33,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:33,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:33,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:33,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:33,221 INFO L272 TraceCheckUtils]: 16: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:33,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {754#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:33,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {744#false} is VALID [2022-04-08 03:54:33,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-08 03:54:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:33,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:33,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430662279] [2022-04-08 03:54:33,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430662279] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:33,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738785522] [2022-04-08 03:54:33,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:54:33,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:33,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:33,236 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-08 03:54:33,251 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-08 03:54:33,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:54:33,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:33,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 03:54:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:33,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:33,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-08 03:54:33,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#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(9, 2); {743#true} is VALID [2022-04-08 03:54:33,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-08 03:54:33,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-08 03:54:33,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-08 03:54:33,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:33,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:33,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:33,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {783#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 03:54:33,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-08 03:54:33,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-08 03:54:33,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-08 03:54:33,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-08 03:54:33,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-08 03:54:33,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume !(0 != #t~nondet2);havoc #t~nondet2; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-08 03:54:33,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume 0 != ~flag~0; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-08 03:54:33,555 INFO L272 TraceCheckUtils]: 16: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:33,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:33,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-08 03:54:33,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-08 03:54:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:33,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:33,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-08 03:54:33,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-08 03:54:33,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:33,787 INFO L272 TraceCheckUtils]: 16: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:33,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:33,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:33,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:33,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:33,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:33,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:33,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:33,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {853#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:33,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:33,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#(= (mod (+ (* main_~j~0 2) main_~b~0) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:33,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {864#(= (mod (+ (* main_~j~0 2) main_~b~0) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:33,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-08 03:54:33,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-08 03:54:33,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-08 03:54:33,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#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(9, 2); {743#true} is VALID [2022-04-08 03:54:33,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-08 03:54:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:33,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738785522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:54:33,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:54:33,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-08 03:54:33,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:33,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1069339118] [2022-04-08 03:54:33,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1069339118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:33,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:33,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:54:33,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449466525] [2022-04-08 03:54:33,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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 20 [2022-04-08 03:54:33,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:33,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-08 03:54:33,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:33,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:54:33,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:33,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:54:33,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:54:33,822 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-08 03:54:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:34,196 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-08 03:54:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:54:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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 20 [2022-04-08 03:54:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-08 03:54:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 03:54:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-08 03:54:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 03:54:34,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-08 03:54:34,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:34,233 INFO L225 Difference]: With dead ends: 39 [2022-04-08 03:54:34,233 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 03:54:34,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-04-08 03:54:34,234 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:34,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:54:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 03:54:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 03:54:34,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:34,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-08 03:54:34,251 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-08 03:54:34,251 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-08 03:54:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:34,252 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 03:54:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 03:54:34,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:34,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:34,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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) Second operand 24 states. [2022-04-08 03:54:34,252 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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) Second operand 24 states. [2022-04-08 03:54:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:34,253 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 03:54:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 03:54:34,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:34,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:34,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:34,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-08 03:54:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-08 03:54:34,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-04-08 03:54:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:34,254 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-08 03:54:34,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-08 03:54:34,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-08 03:54:34,278 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-08 03:54:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 03:54:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 03:54:34,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:34,279 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:34,305 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-08 03:54:34,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:34,491 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 5 times [2022-04-08 03:54:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:34,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10428331] [2022-04-08 03:54:34,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 6 times [2022-04-08 03:54:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:34,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070679037] [2022-04-08 03:54:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:34,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {1087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1073#true} is VALID [2022-04-08 03:54:34,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-08 03:54:34,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-08 03:54:34,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:34,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1073#true} is VALID [2022-04-08 03:54:34,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-08 03:54:34,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-08 03:54:34,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-08 03:54:34,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:34,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:34,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:34,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1080#(and (<= (+ 5 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 2))) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~a~0 main_~j~0 (* main_~i~0 2)) (+ 5 main_~b~0)))} is VALID [2022-04-08 03:54:34,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {1080#(and (<= (+ 5 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 2))) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~a~0 main_~j~0 (* main_~i~0 2)) (+ 5 main_~b~0)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-08 03:54:34,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-08 03:54:34,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1082#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} is VALID [2022-04-08 03:54:34,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-08 03:54:34,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-08 03:54:34,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:34,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:34,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:34,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:34,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:34,699 INFO L272 TraceCheckUtils]: 19: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1085#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:34,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1085#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1086#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:34,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {1086#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1074#false} is VALID [2022-04-08 03:54:34,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-08 03:54:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070679037] [2022-04-08 03:54:34,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070679037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56930919] [2022-04-08 03:54:34,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:54:34,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:34,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:34,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:54:34,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 03:54:34,747 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 03:54:34,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:34,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 03:54:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:34,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:34,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-08 03:54:34,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#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(9, 2); {1073#true} is VALID [2022-04-08 03:54:34,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-08 03:54:34,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-08 03:54:34,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-08 03:54:34,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:34,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:34,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:35,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1115#(and (= (+ (- 2) main_~i~0) 0) (= main_~b~0 (+ (* (- 1) main_~i~0) main_~j~0 2)) (= (+ (- 1) main_~j~0) 0) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 03:54:35,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(and (= (+ (- 2) main_~i~0) 0) (= main_~b~0 (+ (* (- 1) main_~i~0) main_~j~0 2)) (= (+ (- 1) main_~j~0) 0) (= (+ (- 1) main_~a~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} is VALID [2022-04-08 03:54:35,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} is VALID [2022-04-08 03:54:35,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1126#(and (= (+ main_~j~0 (- 3)) 0) (= (+ (- 2) main_~a~0) 0) (= main_~b~0 (+ (* main_~j~0 2) (- 4))) (= main_~i~0 4))} is VALID [2022-04-08 03:54:35,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {1126#(and (= (+ main_~j~0 (- 3)) 0) (= (+ (- 2) main_~a~0) 0) (= main_~b~0 (+ (* main_~j~0 2) (- 4))) (= main_~i~0 4))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} is VALID [2022-04-08 03:54:35,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} is VALID [2022-04-08 03:54:35,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-08 03:54:35,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-08 03:54:35,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-08 03:54:35,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-08 03:54:35,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume 0 != ~flag~0; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-08 03:54:35,005 INFO L272 TraceCheckUtils]: 19: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:35,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:35,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-08 03:54:35,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-08 03:54:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:35,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:35,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-08 03:54:35,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-08 03:54:35,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:35,286 INFO L272 TraceCheckUtils]: 19: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:35,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:35,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:35,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:35,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:35,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:35,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:35,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:35,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1196#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:35,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:35,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:35,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1207#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:35,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-08 03:54:35,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {1218#(= (mod (+ main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-08 03:54:35,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1218#(= (mod (+ main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-08 03:54:35,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-08 03:54:35,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-08 03:54:35,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-08 03:54:35,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#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(9, 2); {1073#true} is VALID [2022-04-08 03:54:35,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-08 03:54:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56930919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:54:35,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:54:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-08 03:54:35,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10428331] [2022-04-08 03:54:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10428331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:35,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 03:54:35,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487647744] [2022-04-08 03:54:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:35,298 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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 23 [2022-04-08 03:54:35,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:35,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-08 03:54:35,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:35,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 03:54:35,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 03:54:35,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-04-08 03:54:35,322 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-08 03:54:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:35,845 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-08 03:54:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 03:54:35,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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 23 [2022-04-08 03:54:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-08 03:54:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-08 03:54:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-08 03:54:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-08 03:54:35,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-04-08 03:54:35,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:35,882 INFO L225 Difference]: With dead ends: 35 [2022-04-08 03:54:35,882 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 03:54:35,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 03:54:35,884 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:35,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 50 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:54:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 03:54:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-08 03:54:35,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:35,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-08 03:54:35,913 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-08 03:54:35,913 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-08 03:54:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:35,914 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 03:54:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-08 03:54:35,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:35,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:35,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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) Second operand 29 states. [2022-04-08 03:54:35,915 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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) Second operand 29 states. [2022-04-08 03:54:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:35,916 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 03:54:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-08 03:54:35,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:35,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:35,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:35,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-08 03:54:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 03:54:35,917 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-08 03:54:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:35,917 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 03:54:35,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-08 03:54:35,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 03:54:35,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 03:54:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 03:54:35,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:35,948 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:35,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 03:54:36,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:36,155 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 1 times [2022-04-08 03:54:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428570691] [2022-04-08 03:54:36,156 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 2 times [2022-04-08 03:54:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386770071] [2022-04-08 03:54:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:36,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:36,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {1447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1439#true} is VALID [2022-04-08 03:54:36,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-08 03:54:36,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-08 03:54:36,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:36,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1439#true} is VALID [2022-04-08 03:54:36,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-08 03:54:36,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-08 03:54:36,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-08 03:54:36,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {1439#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1439#true} is VALID [2022-04-08 03:54:36,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-08 03:54:36,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {1444#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1444#(= main_~i~0 0)} is VALID [2022-04-08 03:54:36,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {1444#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:54:36,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:54:36,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:54:36,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1446#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 4 main_~i~0))} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {1446#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 4 main_~i~0))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {1440#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L272 TraceCheckUtils]: 19: Hoare triple {1440#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-08 03:54:36,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-08 03:54:36,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-08 03:54:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 03:54:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:36,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386770071] [2022-04-08 03:54:36,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386770071] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:36,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287741850] [2022-04-08 03:54:36,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:36,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:36,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:36,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:54:36,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 03:54:36,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:36,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:36,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:54:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:36,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:36,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-08 03:54:36,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#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(9, 2); {1439#true} is VALID [2022-04-08 03:54:36,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-08 03:54:36,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-08 03:54:36,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-08 03:54:36,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {1439#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1439#true} is VALID [2022-04-08 03:54:36,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-08 03:54:36,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {1444#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1444#(= main_~i~0 0)} is VALID [2022-04-08 03:54:36,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {1444#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:54:36,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:54:36,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:54:36,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1484#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 03:54:36,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1440#false} is VALID [2022-04-08 03:54:36,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-08 03:54:36,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1440#false} is VALID [2022-04-08 03:54:36,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {1440#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L272 TraceCheckUtils]: 19: Hoare triple {1440#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-08 03:54:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 03:54:36,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L272 TraceCheckUtils]: 19: Hoare triple {1440#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {1440#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1440#false} is VALID [2022-04-08 03:54:36,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1440#false} is VALID [2022-04-08 03:54:36,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-08 03:54:36,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1440#false} is VALID [2022-04-08 03:54:36,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-08 03:54:36,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-08 03:54:36,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-08 03:54:36,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-08 03:54:36,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-08 03:54:36,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-08 03:54:36,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {1439#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1439#true} is VALID [2022-04-08 03:54:36,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-08 03:54:36,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-08 03:54:36,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-08 03:54:36,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#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(9, 2); {1439#true} is VALID [2022-04-08 03:54:36,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-08 03:54:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 03:54:36,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287741850] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:36,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 03:54:36,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 8 [2022-04-08 03:54:36,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:36,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428570691] [2022-04-08 03:54:36,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428570691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:36,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:36,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:54:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474254762] [2022-04-08 03:54:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:36,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2022-04-08 03:54:36,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:36,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-08 03:54:36,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:36,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:54:36,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:54:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:54:36,591 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-08 03:54:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:36,634 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-08 03:54:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:54:36,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2022-04-08 03:54:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-08 03:54:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-08 03:54:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-08 03:54:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-08 03:54:36,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-04-08 03:54:36,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:36,654 INFO L225 Difference]: With dead ends: 38 [2022-04-08 03:54:36,654 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 03:54:36,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:54:36,655 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:36,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:54:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 03:54:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 03:54:36,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:36,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-08 03:54:36,680 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-08 03:54:36,680 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-08 03:54:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:36,681 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 03:54:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 03:54:36,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:36,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:36,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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) Second operand 27 states. [2022-04-08 03:54:36,682 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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) Second operand 27 states. [2022-04-08 03:54:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:36,683 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 03:54:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 03:54:36,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:36,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:36,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:36,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-08 03:54:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-08 03:54:36,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2022-04-08 03:54:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:36,684 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-08 03:54:36,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-08 03:54:36,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-08 03:54:36,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 03:54:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 03:54:36,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:36,715 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:36,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 03:54:36,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:36,932 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:36,933 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 7 times [2022-04-08 03:54:36,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:36,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250591786] [2022-04-08 03:54:36,933 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 8 times [2022-04-08 03:54:36,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:36,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570772968] [2022-04-08 03:54:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:37,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1771#true} is VALID [2022-04-08 03:54:37,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-08 03:54:37,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-08 03:54:37,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:37,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1771#true} is VALID [2022-04-08 03:54:37,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-08 03:54:37,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-08 03:54:37,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-08 03:54:37,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:37,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:37,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:37,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1778#(and (<= (+ main_~a~0 main_~j~0 (* main_~i~0 3)) (+ 7 main_~b~0)) (= (+ (- 1) main_~j~0) 0) (<= (+ 7 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 3))))} is VALID [2022-04-08 03:54:37,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#(and (<= (+ main_~a~0 main_~j~0 (* main_~i~0 3)) (+ 7 main_~b~0)) (= (+ (- 1) main_~j~0) 0) (<= (+ 7 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 3))))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} is VALID [2022-04-08 03:54:37,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} is VALID [2022-04-08 03:54:37,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1780#(and (<= (+ main_~a~0 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0 2)) (<= (+ (* main_~j~0 2) main_~b~0 2) (+ main_~a~0 (* main_~i~0 2))))} is VALID [2022-04-08 03:54:37,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1780#(and (<= (+ main_~a~0 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0 2)) (<= (+ (* main_~j~0 2) main_~b~0 2) (+ main_~a~0 (* main_~i~0 2))))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-08 03:54:37,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-08 03:54:37,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1782#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} is VALID [2022-04-08 03:54:37,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-08 03:54:37,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-08 03:54:37,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:37,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:37,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:37,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:37,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 03:54:37,185 INFO L272 TraceCheckUtils]: 22: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1785#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:37,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {1785#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1786#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:37,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1772#false} is VALID [2022-04-08 03:54:37,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-08 03:54:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570772968] [2022-04-08 03:54:37,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570772968] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:54:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527112010] [2022-04-08 03:54:37,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:54:37,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:37,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:37,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:54:37,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 03:54:37,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:54:37,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:54:37,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 03:54:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:37,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:54:37,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-08 03:54:37,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#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(9, 2); {1771#true} is VALID [2022-04-08 03:54:37,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-08 03:54:37,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-08 03:54:37,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-08 03:54:37,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-08 03:54:37,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:37,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-08 03:54:37,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1815#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 03:54:37,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {1815#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 03:54:37,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 03:54:37,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1826#(and (= (+ main_~b~0 2 (* (- 1) main_~j~0)) 1) (= main_~j~0 3) (= main_~a~0 2) (= main_~i~0 4))} is VALID [2022-04-08 03:54:37,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {1826#(and (= (+ main_~b~0 2 (* (- 1) main_~j~0)) 1) (= main_~j~0 3) (= main_~a~0 2) (= main_~i~0 4))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} is VALID [2022-04-08 03:54:37,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} is VALID [2022-04-08 03:54:37,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1837#(and (= (+ (* main_~j~0 2) (* (- 1) main_~b~0) (- 3)) 4) (= (+ (- 2) main_~j~0) 3) (= main_~i~0 (+ (- 1) (* main_~j~0 2) (* (- 1) main_~b~0))) (= main_~a~0 3))} is VALID [2022-04-08 03:54:37,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {1837#(and (= (+ (* main_~j~0 2) (* (- 1) main_~b~0) (- 3)) 4) (= (+ (- 2) main_~j~0) 3) (= main_~i~0 (+ (- 1) (* main_~j~0 2) (* (- 1) main_~b~0))) (= main_~a~0 3))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} is VALID [2022-04-08 03:54:37,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} is VALID [2022-04-08 03:54:37,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-08 03:54:37,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-08 03:54:37,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-08 03:54:37,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-08 03:54:37,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume 0 != ~flag~0; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-08 03:54:37,663 INFO L272 TraceCheckUtils]: 22: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:37,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:37,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-08 03:54:37,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-08 03:54:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:37,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:54:38,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-08 03:54:38,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-08 03:54:38,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:54:38,005 INFO L272 TraceCheckUtils]: 22: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:54:38,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:38,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:38,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:38,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:38,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-08 03:54:38,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:38,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {1907#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:38,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1907#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-08 03:54:38,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:38,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {1918#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:38,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1918#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-08 03:54:38,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-08 03:54:38,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 6 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-08 03:54:38,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1929#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 6 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-08 03:54:38,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} is VALID [2022-04-08 03:54:38,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {1940#(= (mod (+ main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} is VALID [2022-04-08 03:54:38,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1940#(= (mod (+ main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} is VALID [2022-04-08 03:54:38,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-08 03:54:38,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-08 03:54:38,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-08 03:54:38,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#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(9, 2); {1771#true} is VALID [2022-04-08 03:54:38,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-08 03:54:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:54:38,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527112010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:54:38,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:54:38,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-04-08 03:54:38,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:38,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250591786] [2022-04-08 03:54:38,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250591786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:38,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:38,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:54:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573624825] [2022-04-08 03:54:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:38,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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 26 [2022-04-08 03:54:38,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:38,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-08 03:54:38,044 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-08 03:54:38,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 03:54:38,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:38,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 03:54:38,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2022-04-08 03:54:38,045 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-08 03:54:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:38,439 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 03:54:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:54:38,439 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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 26 [2022-04-08 03:54:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-08 03:54:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-08 03:54:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-08 03:54:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-08 03:54:38,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 19 transitions. [2022-04-08 03:54:38,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:38,457 INFO L225 Difference]: With dead ends: 27 [2022-04-08 03:54:38,457 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:54:38,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 03:54:38,458 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:38,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:54:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:54:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:54:38,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:38,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:54:38,459 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:54:38,459 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:54:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:38,459 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:54:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:54:38,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:38,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:38,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:54:38,460 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:54:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:38,460 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:54:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:54:38,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:38,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:38,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:38,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:54:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:54:38,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-08 03:54:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:38,460 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:54:38,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-08 03:54:38,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:54:38,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:54:38,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:38,463 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:54:38,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 03:54:38,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:54:38,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:54:38,947 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 03:54:38,947 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 03:54:38,947 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 03:54:38,947 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 03:54:38,947 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:54:38,947 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:54:38,947 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:54:38,947 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 24 49) the Hoare annotation is: (or (= main_~flag~0 0) (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (let ((.cse3 (+ main_~b~0 (* .cse0 4294967296))) (.cse2 (* .cse1 4294967296))) (and (<= .cse0 .cse1) (<= (+ main_~a~0 .cse2) .cse3) (< .cse3 (+ main_~a~0 .cse2 1)))))) [2022-04-08 03:54:38,947 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 49) the Hoare annotation is: true [2022-04-08 03:54:38,947 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (let ((.cse3 (+ main_~b~0 (* .cse0 4294967296))) (.cse2 (* .cse1 4294967296))) (and (<= .cse0 .cse1) (<= (+ main_~a~0 .cse2) .cse3) (< .cse3 (+ main_~a~0 .cse2 1))))) [2022-04-08 03:54:38,947 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 49) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L878 garLoopResultBuilder]: At program point L30(lines 30 34) the Hoare annotation is: (and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0)) [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 49) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point L45(lines 45 47) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 43) the Hoare annotation is: (or (= main_~flag~0 0) (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~a~0 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0 2)) (= 0 (mod main_~i~0 2)) (<= .cse0 .cse1) (<= (+ main_~a~0 (* .cse1 4294967296)) (+ main_~b~0 (* .cse0 4294967296)))))) [2022-04-08 03:54:38,948 INFO L878 garLoopResultBuilder]: At program point L39-2(lines 24 49) the Hoare annotation is: (or (let ((.cse1 (+ main_~b~0 (* main_~j~0 3))) (.cse0 (+ main_~a~0 3 (* main_~i~0 3))) (.cse3 (+ main_~a~0 2 (* main_~i~0 2))) (.cse2 (+ (* main_~j~0 2) main_~b~0))) (and (= 0 (mod main_~i~0 2)) (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse1 .cse0) (<= .cse3 .cse2))) (= main_~flag~0 0)) [2022-04-08 03:54:38,948 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 44) the Hoare annotation is: (or (let ((.cse1 (+ main_~b~0 (* main_~j~0 3))) (.cse0 (+ main_~a~0 3 (* main_~i~0 3))) (.cse3 (+ main_~a~0 2 (* main_~i~0 2))) (.cse2 (+ (* main_~j~0 2) main_~b~0))) (and (= 0 (mod main_~i~0 2)) (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse1 .cse0) (<= .cse3 .cse2))) (= main_~flag~0 0)) [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 03:54:38,948 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 03:54:38,949 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:54:38,949 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:54:38,949 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:54:38,951 INFO L719 BasicCegarLoop]: Path program histogram: [8, 2, 2, 2, 2] [2022-04-08 03:54:38,952 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:54:38,954 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:54:38,954 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:54:38,955 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 03:54:38,955 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 03:54:38,956 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:54:38,956 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:54:38,957 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 03:54:38,970 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:54:38,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:54:38 BoogieIcfgContainer [2022-04-08 03:54:38,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:54:38,975 INFO L158 Benchmark]: Toolchain (without parser) took 9176.24ms. Allocated memory was 229.6MB in the beginning and 290.5MB in the end (delta: 60.8MB). Free memory was 180.2MB in the beginning and 101.5MB in the end (delta: 78.7MB). Peak memory consumption was 139.1MB. Max. memory is 8.0GB. [2022-04-08 03:54:38,975 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory was 196.1MB in the beginning and 196.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:54:38,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.92ms. Allocated memory is still 229.6MB. Free memory was 179.9MB in the beginning and 205.8MB in the end (delta: -25.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 03:54:38,975 INFO L158 Benchmark]: Boogie Preprocessor took 28.30ms. Allocated memory is still 229.6MB. Free memory was 205.8MB in the beginning and 204.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:54:38,976 INFO L158 Benchmark]: RCFGBuilder took 246.99ms. Allocated memory is still 229.6MB. Free memory was 204.4MB in the beginning and 192.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 03:54:38,976 INFO L158 Benchmark]: TraceAbstraction took 8721.86ms. Allocated memory was 229.6MB in the beginning and 290.5MB in the end (delta: 60.8MB). Free memory was 192.6MB in the beginning and 101.5MB in the end (delta: 91.1MB). Peak memory consumption was 153.0MB. Max. memory is 8.0GB. [2022-04-08 03:54:38,992 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.09ms. Allocated memory is still 229.6MB. Free memory was 196.1MB in the beginning and 196.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.92ms. Allocated memory is still 229.6MB. Free memory was 179.9MB in the beginning and 205.8MB in the end (delta: -25.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.30ms. Allocated memory is still 229.6MB. Free memory was 205.8MB in the beginning and 204.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 246.99ms. Allocated memory is still 229.6MB. Free memory was 204.4MB in the beginning and 192.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8721.86ms. Allocated memory was 229.6MB in the beginning and 290.5MB in the end (delta: 60.8MB). Free memory was 192.6MB in the beginning and 101.5MB in the end (delta: 91.1MB). Peak memory consumption was 153.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 129 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 9 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 71 PreInvPairs, 118 NumberOfFragments, 296 HoareAnnotationTreeSize, 71 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 1239 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 03:54:39,013 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...