/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/ddlm2013.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:39:55,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:39:55,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:39:55,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:39:55,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:39:55,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:39:55,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:39:55,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:39:55,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:39:55,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:39:55,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:39:55,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:39:55,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:39:55,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:39:55,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:39:55,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:39:55,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:39:55,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:39:55,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:39:55,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:39:55,361 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:39:55,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:39:55,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:39:55,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:39:55,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:39:55,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:39:55,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:39:55,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:39:55,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:39:55,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:39:55,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:39:55,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:39:55,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:39:55,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:39:55,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:39:55,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:39:55,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:39:55,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:39:55,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:39:55,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:39:55,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:39:55,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:39:55,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:39:55,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:39:55,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:39:55,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:39:55,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:39:55,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:39:55,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:39:55,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:39:55,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:39:55,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:39:55,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:39:55,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:39:55,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:39:55,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:39:55,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:39:55,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:39:55,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:55,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:39:55,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:39:55,395 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:39:55,395 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:39:55,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:39:55,395 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:39:55,396 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-28 09:39:55,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:39:55,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:39:55,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:39:55,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:39:55,612 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:39:55,613 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-28 09:39:55,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0de4d544/fc995c7a0b2f4be1ba287f02a3b3a8a4/FLAG121561e0a [2022-04-28 09:39:56,065 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:39:56,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-28 09:39:56,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0de4d544/fc995c7a0b2f4be1ba287f02a3b3a8a4/FLAG121561e0a [2022-04-28 09:39:56,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0de4d544/fc995c7a0b2f4be1ba287f02a3b3a8a4 [2022-04-28 09:39:56,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:39:56,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:39:56,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:56,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:39:56,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:39:56,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492883d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56, skipping insertion in model container [2022-04-28 09:39:56,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:39:56,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:39:56,658 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-28 09:39:56,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:56,683 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:39:56,694 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-28 09:39:56,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:56,710 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:39:56,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56 WrapperNode [2022-04-28 09:39:56,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:56,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:39:56,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:39:56,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:39:56,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:39:56,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:39:56,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:39:56,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:39:56,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (1/1) ... [2022-04-28 09:39:56,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:56,767 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-28 09:39:56,775 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-28 09:39:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:39:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:39:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:39:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:39:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:39:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:39:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:39:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:39:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:39:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:39:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:39:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:39:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:39:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:39:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:39:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:39:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:39:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:39:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:39:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:39:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:39:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:39:56,863 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:39:56,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:39:57,004 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:39:57,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:39:57,009 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:39:57,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:57 BoogieIcfgContainer [2022-04-28 09:39:57,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:39:57,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:39:57,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:39:57,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:39:57,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:39:56" (1/3) ... [2022-04-28 09:39:57,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed2270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:57, skipping insertion in model container [2022-04-28 09:39:57,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:56" (2/3) ... [2022-04-28 09:39:57,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed2270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:57, skipping insertion in model container [2022-04-28 09:39:57,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:57" (3/3) ... [2022-04-28 09:39:57,031 INFO L111 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2022-04-28 09:39:57,054 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:39:57,054 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:39:57,089 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:39:57,094 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@248896b1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@287fd0f0 [2022-04-28 09:39:57,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:39:57,102 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-28 09:39:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:39:57,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:57,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:57,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:57,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 1 times [2022-04-28 09:39:57,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:57,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687762857] [2022-04-28 09:39:57,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 2 times [2022-04-28 09:39:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:57,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469869876] [2022-04-28 09:39:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:57,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:57,298 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-28 09:39:57,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 09:39:57,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-28 09:39:57,311 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-28 09:39:57,312 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-28 09:39:57,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 09:39:57,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-28 09:39:57,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-28 09:39:57,313 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-28 09:39:57,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume 0 != ~flag~0;~i~0 := 0; {26#true} is VALID [2022-04-28 09:39:57,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 09:39:57,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 != ~flag~0; {27#false} is VALID [2022-04-28 09:39:57,314 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-28 09:39:57,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 09:39:57,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 09:39:57,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 09:39:57,315 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-28 09:39:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:57,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469869876] [2022-04-28 09:39:57,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469869876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:57,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:57,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:39:57,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:57,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687762857] [2022-04-28 09:39:57,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687762857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:57,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:57,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:39:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888240803] [2022-04-28 09:39:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:57,328 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-28 09:39:57,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:57,332 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-28 09:39:57,350 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-28 09:39:57,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:39:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:39:57,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:39:57,372 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-28 09:39:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:57,456 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 09:39:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:39:57,458 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-28 09:39:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:57,461 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-28 09:39:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-28 09:39:57,467 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-28 09:39:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-28 09:39:57,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-28 09:39:57,518 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-28 09:39:57,525 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:39:57,525 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:39:57,528 INFO L412 NwaCegarLoop]: 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-28 09:39:57,531 INFO L413 NwaCegarLoop]: 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-28 09:39:57,533 INFO L414 NwaCegarLoop]: 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-28 09:39:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:39:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:39:57,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:57,560 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-28 09:39:57,560 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-28 09:39:57,560 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-28 09:39:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:57,563 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 09:39:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:39:57,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:57,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:57,564 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-28 09:39:57,564 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-28 09:39:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:57,566 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 09:39:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:39:57,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:57,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:57,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:57,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:57,567 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-28 09:39:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 09:39:57,570 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-28 09:39:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:57,570 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 09:39:57,570 INFO L496 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-28 09:39:57,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 09:39:57,590 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-28 09:39:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:39:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:39:57,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:57,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:57,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:39:57,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 1 times [2022-04-28 09:39:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:57,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1098570624] [2022-04-28 09:39:57,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 2 times [2022-04-28 09:39:57,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:57,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968351529] [2022-04-28 09:39:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:57,773 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-28 09:39:57,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-28 09:39:57,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-28 09:39:57,774 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-28 09:39:57,774 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-28 09:39:57,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-28 09:39:57,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-28 09:39:57,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret5 := main(); {170#true} is VALID [2022-04-28 09:39:57,776 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-28 09:39:57,777 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-28 09:39:57,777 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-28 09:39:57,778 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-28 09:39:57,779 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-28 09:39:57,779 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-28 09:39:57,780 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-28 09:39:57,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {177#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {171#false} is VALID [2022-04-28 09:39:57,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-04-28 09:39:57,781 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-28 09:39:57,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968351529] [2022-04-28 09:39:57,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968351529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:57,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:57,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:39:57,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1098570624] [2022-04-28 09:39:57,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1098570624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:57,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:57,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:39:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896238082] [2022-04-28 09:39:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:57,784 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-28 09:39:57,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:57,785 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-28 09:39:57,802 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-28 09:39:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:39:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:39:57,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:39:57,804 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-28 09:39:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:57,993 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 09:39:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:39:57,993 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-28 09:39:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:57,994 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-28 09:39:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 09:39:57,997 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-28 09:39:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 09:39:58,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 09:39:58,031 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-28 09:39:58,033 INFO L225 Difference]: With dead ends: 24 [2022-04-28 09:39:58,033 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:39:58,034 INFO L412 NwaCegarLoop]: 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-28 09:39:58,037 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:58,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:39:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:39:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 09:39:58,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:58,048 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-28 09:39:58,049 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-28 09:39:58,049 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-28 09:39:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:58,052 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 09:39:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 09:39:58,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:58,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:58,053 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-28 09:39:58,053 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-28 09:39:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:58,055 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 09:39:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 09:39:58,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:58,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:58,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:58,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:58,057 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-28 09:39:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 09:39:58,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-28 09:39:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:58,059 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 09:39:58,059 INFO L496 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-28 09:39:58,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 09:39:58,080 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-28 09:39:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 09:39:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:39:58,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:58,082 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:58,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:39:58,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 1 times [2022-04-28 09:39:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1827104075] [2022-04-28 09:39:58,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 2 times [2022-04-28 09:39:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:58,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8779224] [2022-04-28 09:39:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:58,515 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-28 09:39:58,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 09:39:58,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 09:39:58,517 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-28 09:39:58,518 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-28 09:39:58,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 09:39:58,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 09:39:58,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-28 09:39:58,523 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-28 09:39:58,524 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-28 09:39:58,524 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-28 09:39:58,526 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-28 09:39:58,527 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-28 09:39:58,527 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-28 09:39:58,528 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-28 09:39:58,531 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-28 09:39:58,533 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-28 09:39:58,534 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-28 09:39:58,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {317#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {308#false} is VALID [2022-04-28 09:39:58,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 09:39:58,537 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-28 09:39:58,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:58,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8779224] [2022-04-28 09:39:58,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8779224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:58,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862811291] [2022-04-28 09:39:58,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:39:58,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:58,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:58,543 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-28 09:39:58,574 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-28 09:39:58,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:39:58,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:58,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:39:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:58,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:58,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-28 09:39:58,861 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-28 09:39:58,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 09:39:58,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 09:39:58,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-28 09:39:58,864 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-28 09:39:58,865 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-28 09:39:58,866 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-28 09:39:58,866 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-28 09:39:58,867 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-28 09:39:58,867 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-28 09:39:58,868 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-28 09:39:58,869 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-28 09:39:58,870 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-28 09:39:58,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:58,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-28 09:39:58,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 09:39:58,872 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-28 09:39:58,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:59,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 09:39:59,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-28 09:39:59,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:59,074 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-28 09:39:59,074 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-28 09:39:59,075 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-28 09:39:59,075 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-28 09:39:59,076 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-28 09:39:59,079 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-28 09:39:59,080 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-28 09:39:59,081 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-28 09:39:59,081 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-28 09:39:59,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-28 09:39:59,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 09:39:59,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 09:39:59,082 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-28 09:39:59,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-28 09:39:59,082 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-28 09:39:59,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862811291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:59,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:59,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-28 09:39:59,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:59,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1827104075] [2022-04-28 09:39:59,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1827104075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:59,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:59,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:39:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839234879] [2022-04-28 09:39:59,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:59,085 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-28 09:39:59,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:59,085 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-28 09:39:59,104 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-28 09:39:59,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:39:59,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:39:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:39:59,107 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-28 09:39:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:59,378 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 09:39:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:39:59,379 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-28 09:39:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:59,379 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-28 09:39:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 09:39:59,381 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-28 09:39:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 09:39:59,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 09:39:59,417 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-28 09:39:59,418 INFO L225 Difference]: With dead ends: 29 [2022-04-28 09:39:59,418 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 09:39:59,419 INFO L412 NwaCegarLoop]: 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-28 09:39:59,420 INFO L413 NwaCegarLoop]: 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-28 09:39:59,421 INFO L414 NwaCegarLoop]: 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-28 09:39:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 09:39:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-28 09:39:59,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:59,436 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-28 09:39:59,436 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-28 09:39:59,436 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-28 09:39:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:59,438 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 09:39:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 09:39:59,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:59,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:59,439 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-28 09:39:59,439 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-28 09:39:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:59,446 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 09:39:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 09:39:59,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:59,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:59,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:59,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:59,447 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-28 09:39:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 09:39:59,448 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-04-28 09:39:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:59,449 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 09:39:59,452 INFO L496 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-28 09:39:59,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 09:39:59,479 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-28 09:39:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 09:39:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:39:59,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:59,480 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:59,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 09:39:59,692 WARN L477 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-28 09:39:59,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 1 times [2022-04-28 09:39:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:59,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148222853] [2022-04-28 09:39:59,694 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 2 times [2022-04-28 09:39:59,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:59,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280551472] [2022-04-28 09:39:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:59,739 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-28 09:39:59,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-28 09:39:59,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-28 09:39:59,740 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-28 09:39:59,740 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-28 09:39:59,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-28 09:39:59,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-28 09:39:59,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#true} call #t~ret5 := main(); {584#true} is VALID [2022-04-28 09:39:59,741 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-28 09:39:59,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} assume !(0 != ~flag~0);~i~0 := 1; {589#(= main_~flag~0 0)} is VALID [2022-04-28 09:39:59,742 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-28 09:39:59,743 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-28 09:39:59,743 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-28 09:39:59,744 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-28 09:39:59,744 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-28 09:39:59,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#(= main_~flag~0 0)} assume 0 != ~flag~0; {585#false} is VALID [2022-04-28 09:39:59,745 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-28 09:39:59,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {585#false} ~cond := #in~cond; {585#false} is VALID [2022-04-28 09:39:59,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#false} assume 0 == ~cond; {585#false} is VALID [2022-04-28 09:39:59,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-04-28 09:39:59,746 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-28 09:39:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:59,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280551472] [2022-04-28 09:39:59,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280551472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:59,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:59,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:59,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:59,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148222853] [2022-04-28 09:39:59,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148222853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:59,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:59,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200924558] [2022-04-28 09:39:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:59,748 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-28 09:39:59,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:59,749 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-28 09:39:59,761 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-28 09:39:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:39:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:39:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:39:59,762 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-28 09:39:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:59,841 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 09:39:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:39:59,841 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-28 09:39:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:59,841 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-28 09:39:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 09:39:59,843 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-28 09:39:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 09:39:59,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 09:39:59,866 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-28 09:39:59,867 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:39:59,867 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 09:39:59,867 INFO L412 NwaCegarLoop]: 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-28 09:39:59,868 INFO L413 NwaCegarLoop]: 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-28 09:39:59,869 INFO L414 NwaCegarLoop]: 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-28 09:39:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 09:39:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 09:39:59,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:59,879 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-28 09:39:59,880 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-28 09:39:59,880 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-28 09:39:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:59,881 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 09:39:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 09:39:59,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:59,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:59,882 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-28 09:39:59,882 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-28 09:39:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:59,883 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 09:39:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 09:39:59,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:59,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:59,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:59,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:59,884 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-28 09:39:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 09:39:59,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-28 09:39:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:59,885 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 09:39:59,885 INFO L496 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-28 09:39:59,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 09:39:59,914 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-28 09:39:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 09:39:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:39:59,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:59,915 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:59,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:39:59,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:59,915 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 3 times [2022-04-28 09:39:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:59,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783547750] [2022-04-28 09:39:59,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 4 times [2022-04-28 09:39:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:59,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258842341] [2022-04-28 09:39:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:00,113 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-28 09:40:00,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 09:40:00,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 09:40:00,114 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-28 09:40:00,114 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-28 09:40:00,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 09:40:00,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 09:40:00,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-28 09:40:00,116 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-28 09:40:00,117 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-28 09:40:00,117 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-28 09:40:00,119 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-28 09:40:00,120 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-28 09:40:00,129 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-28 09:40:00,130 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-28 09:40:00,131 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-28 09:40:00,132 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-28 09:40:00,132 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-28 09:40:00,133 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-28 09:40:00,134 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-28 09:40:00,135 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-28 09:40:00,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {744#false} is VALID [2022-04-28 09:40:00,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-28 09:40:00,136 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-28 09:40:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258842341] [2022-04-28 09:40:00,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258842341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533708257] [2022-04-28 09:40:00,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:40:00,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:00,138 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-28 09:40:00,171 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-28 09:40:00,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:40:00,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:00,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 09:40:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:00,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:00,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-28 09:40:00,422 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-28 09:40:00,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 09:40:00,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 09:40:00,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-28 09:40:00,423 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-28 09:40:00,424 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-28 09:40:00,424 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-28 09:40:00,425 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-28 09:40:00,426 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-28 09:40:00,426 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-28 09:40:00,428 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-28 09:40:00,428 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-28 09:40:00,429 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-28 09:40:00,429 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-28 09:40:00,430 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-28 09:40:00,430 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-28 09:40:00,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:00,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-28 09:40:00,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-28 09:40:00,432 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-28 09:40:00,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:40:00,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-28 09:40:00,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-28 09:40:00,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:00,678 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-28 09:40:00,680 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-28 09:40:00,680 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-28 09:40:00,681 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-28 09:40:00,681 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-28 09:40:00,683 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-28 09:40:00,683 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-28 09:40:00,685 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-28 09:40:00,687 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-28 09:40:00,687 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-28 09:40:00,688 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-28 09:40:00,688 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-28 09:40:00,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-28 09:40:00,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 09:40:00,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 09:40:00,689 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-28 09:40:00,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-28 09:40:00,689 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-28 09:40:00,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533708257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:40:00,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:40:00,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-28 09:40:00,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:00,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1783547750] [2022-04-28 09:40:00,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1783547750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:00,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:00,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:40:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618287343] [2022-04-28 09:40:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:00,691 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-28 09:40:00,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:00,691 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-28 09:40:00,711 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-28 09:40:00,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:40:00,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:00,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:40:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:40:00,713 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-28 09:40:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:01,134 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 09:40:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:40:01,134 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-28 09:40:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:01,135 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-28 09:40:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 09:40:01,136 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-28 09:40:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 09:40:01,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-28 09:40:01,193 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-28 09:40:01,194 INFO L225 Difference]: With dead ends: 39 [2022-04-28 09:40:01,194 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 09:40:01,194 INFO L412 NwaCegarLoop]: 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-28 09:40:01,195 INFO L413 NwaCegarLoop]: 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-28 09:40:01,195 INFO L414 NwaCegarLoop]: 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-28 09:40:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 09:40:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 09:40:01,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:01,214 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-28 09:40:01,214 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-28 09:40:01,214 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-28 09:40:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:01,215 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 09:40:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 09:40:01,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:01,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:01,215 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-28 09:40:01,216 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-28 09:40:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:01,216 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 09:40:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 09:40:01,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:01,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:01,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:01,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:01,217 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-28 09:40:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 09:40:01,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-04-28 09:40:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:01,218 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 09:40:01,219 INFO L496 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-28 09:40:01,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 09:40:01,252 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-28 09:40:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 09:40:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:40:01,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:01,254 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:01,282 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-28 09:40:01,467 WARN L477 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-28 09:40:01,468 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 5 times [2022-04-28 09:40:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:01,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318635967] [2022-04-28 09:40:01,469 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:40:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 6 times [2022-04-28 09:40:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:01,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228102525] [2022-04-28 09:40:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:01,698 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-28 09:40:01,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 09:40:01,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 09:40:01,699 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-28 09:40:01,699 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-28 09:40:01,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 09:40:01,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 09:40:01,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-28 09:40:01,700 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-28 09:40:01,701 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-28 09:40:01,701 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-28 09:40:01,702 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-28 09:40:01,702 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-28 09:40:01,703 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-28 09:40:01,704 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-28 09:40:01,705 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-28 09:40:01,705 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-28 09:40:01,707 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-28 09:40:01,708 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-28 09:40:01,708 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-28 09:40:01,709 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-28 09:40:01,710 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-28 09:40:01,711 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-28 09:40:01,711 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-28 09:40:01,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {1086#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1074#false} is VALID [2022-04-28 09:40:01,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-28 09:40:01,712 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-28 09:40:01,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228102525] [2022-04-28 09:40:01,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228102525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252144254] [2022-04-28 09:40:01,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:40:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:01,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:01,714 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-28 09:40:01,715 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-28 09:40:01,759 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:40:01,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:01,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:40:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:01,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:02,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-28 09:40:02,056 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-28 09:40:02,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 09:40:02,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 09:40:02,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-28 09:40:02,061 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-28 09:40:02,062 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-28 09:40:02,062 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-28 09:40:02,063 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-28 09:40:02,063 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-28 09:40:02,064 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-28 09:40:02,064 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-28 09:40:02,065 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-28 09:40:02,065 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-28 09:40:02,066 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-28 09:40:02,066 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-28 09:40:02,067 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-28 09:40:02,067 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-28 09:40:02,068 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-28 09:40:02,068 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-28 09:40:02,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:02,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-28 09:40:02,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-28 09:40:02,070 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-28 09:40:02,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:40:02,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-28 09:40:02,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-28 09:40:02,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:02,381 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-28 09:40:02,381 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-28 09:40:02,382 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-28 09:40:02,382 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-28 09:40:02,383 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-28 09:40:02,384 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-28 09:40:02,385 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-28 09:40:02,387 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-28 09:40:02,389 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-28 09:40:02,389 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-28 09:40:02,391 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-28 09:40:02,393 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-28 09:40:02,393 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-28 09:40:02,394 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-28 09:40:02,394 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-28 09:40:02,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-28 09:40:02,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 09:40:02,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 09:40:02,395 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-28 09:40:02,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-28 09:40:02,395 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-28 09:40:02,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252144254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:40:02,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:40:02,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-28 09:40:02,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:02,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318635967] [2022-04-28 09:40:02,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318635967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:02,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:02,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:40:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814142131] [2022-04-28 09:40:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:02,397 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-28 09:40:02,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:02,397 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-28 09:40:02,420 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-28 09:40:02,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:40:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:40:02,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:40:02,421 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-28 09:40:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:03,047 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-28 09:40:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:40:03,047 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-28 09:40:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:03,048 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-28 09:40:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-28 09:40:03,049 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-28 09:40:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-28 09:40:03,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-04-28 09:40:03,093 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-28 09:40:03,094 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:40:03,094 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 09:40:03,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 09:40:03,096 INFO L413 NwaCegarLoop]: 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-28 09:40:03,096 INFO L414 NwaCegarLoop]: 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-28 09:40:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 09:40:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-28 09:40:03,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:03,127 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-28 09:40:03,128 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-28 09:40:03,128 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-28 09:40:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:03,129 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 09:40:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 09:40:03,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:03,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:03,130 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-28 09:40:03,130 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-28 09:40:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:03,131 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 09:40:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 09:40:03,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:03,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:03,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:03,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:03,132 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-28 09:40:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 09:40:03,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 09:40:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:03,133 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 09:40:03,133 INFO L496 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-28 09:40:03,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 09:40:03,169 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-28 09:40:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 09:40:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:40:03,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:03,170 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:03,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:40:03,371 WARN L477 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-28 09:40:03,371 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 1 times [2022-04-28 09:40:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737020658] [2022-04-28 09:40:03,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:40:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 2 times [2022-04-28 09:40:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208462648] [2022-04-28 09:40:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:03,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:03,472 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-28 09:40:03,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 09:40:03,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 09:40:03,473 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-28 09:40:03,476 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-28 09:40:03,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 09:40:03,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 09:40:03,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-28 09:40:03,485 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-28 09:40:03,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-28 09:40:03,486 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-28 09:40:03,487 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-28 09:40:03,488 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-28 09:40:03,491 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-28 09:40:03,492 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-28 09:40:03,493 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-28 09:40:03,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 09:40:03,493 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-28 09:40:03,493 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-28 09:40:03,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 09:40:03,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-28 09:40:03,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-28 09:40:03,494 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-28 09:40:03,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-28 09:40:03,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-28 09:40:03,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-28 09:40:03,494 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-28 09:40:03,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:03,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208462648] [2022-04-28 09:40:03,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208462648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:03,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739524116] [2022-04-28 09:40:03,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:40:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:03,496 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-28 09:40:03,519 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-28 09:40:03,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:40:03,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:03,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:40:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:03,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:03,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-28 09:40:03,825 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-28 09:40:03,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 09:40:03,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 09:40:03,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-28 09:40:03,825 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-28 09:40:03,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-28 09:40:03,827 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-28 09:40:03,827 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-28 09:40:03,828 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-28 09:40:03,828 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-28 09:40:03,829 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-28 09:40:03,830 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-28 09:40:03,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 09:40:03,830 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-28 09:40:03,830 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-28 09:40:03,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 09:40:03,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-28 09:40:03,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-28 09:40:03,830 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-28 09:40:03,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-28 09:40:03,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-28 09:40:03,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-28 09:40:03,831 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-28 09:40:03,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:40:03,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-28 09:40:03,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-28 09:40:03,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-28 09:40:03,899 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-28 09:40:03,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-28 09:40:03,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-28 09:40:03,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 09:40:03,900 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-28 09:40:03,900 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-28 09:40:03,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 09:40:03,900 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-28 09:40:03,901 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-28 09:40:03,902 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-28 09:40:03,903 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-28 09:40:03,904 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-28 09:40:03,904 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-28 09:40:03,905 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-28 09:40:03,905 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-28 09:40:03,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-28 09:40:03,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 09:40:03,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 09:40:03,905 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-28 09:40:03,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-28 09:40:03,906 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-28 09:40:03,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739524116] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:03,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:40:03,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 8 [2022-04-28 09:40:03,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:03,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737020658] [2022-04-28 09:40:03,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737020658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:03,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:03,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:40:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139422068] [2022-04-28 09:40:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:03,907 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-28 09:40:03,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:03,907 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-28 09:40:03,921 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-28 09:40:03,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:40:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:03,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:40:03,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:40:03,922 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-28 09:40:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:03,974 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-28 09:40:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:40:03,974 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-28 09:40:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:03,974 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-28 09:40:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-28 09:40:03,975 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-28 09:40:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-28 09:40:03,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-04-28 09:40:03,998 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-28 09:40:03,999 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:40:03,999 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:40:04,000 INFO L412 NwaCegarLoop]: 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-28 09:40:04,000 INFO L413 NwaCegarLoop]: 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-28 09:40:04,000 INFO L414 NwaCegarLoop]: 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-28 09:40:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:40:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 09:40:04,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:04,034 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-28 09:40:04,034 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-28 09:40:04,034 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-28 09:40:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:04,035 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:40:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:40:04,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:04,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:04,036 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-28 09:40:04,036 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-28 09:40:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:04,037 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:40:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:40:04,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:04,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:04,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:04,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:04,037 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-28 09:40:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 09:40:04,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2022-04-28 09:40:04,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:04,038 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 09:40:04,038 INFO L496 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-28 09:40:04,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 09:40:04,072 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-28 09:40:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:40:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 09:40:04,073 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:04,073 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:04,099 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-28 09:40:04,285 WARN L477 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-28 09:40:04,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 7 times [2022-04-28 09:40:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:04,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038707632] [2022-04-28 09:40:04,286 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:40:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 8 times [2022-04-28 09:40:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:04,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669183211] [2022-04-28 09:40:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:04,631 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-28 09:40:04,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 09:40:04,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 09:40:04,632 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-28 09:40:04,632 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-28 09:40:04,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 09:40:04,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 09:40:04,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-28 09:40:04,633 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-28 09:40:04,634 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-28 09:40:04,634 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-28 09:40:04,635 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-28 09:40:04,636 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-28 09:40:04,637 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-28 09:40:04,638 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-28 09:40:04,639 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-28 09:40:04,640 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-28 09:40:04,640 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-28 09:40:04,641 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-28 09:40:04,642 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-28 09:40:04,643 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-28 09:40:04,644 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-28 09:40:04,647 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-28 09:40:04,648 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-28 09:40:04,648 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-28 09:40:04,649 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-28 09:40:04,650 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-28 09:40:04,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 09:40:04,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 09:40:04,651 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-28 09:40:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:04,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669183211] [2022-04-28 09:40:04,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669183211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:04,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768610941] [2022-04-28 09:40:04,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:40:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:04,653 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-28 09:40:04,654 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-28 09:40:04,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:40:04,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:04,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 09:40:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:04,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:05,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-28 09:40:05,103 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-28 09:40:05,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 09:40:05,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 09:40:05,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-28 09:40:05,104 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-28 09:40:05,104 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-28 09:40:05,105 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-28 09:40:05,105 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-28 09:40:05,106 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-28 09:40:05,106 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-28 09:40:05,107 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-28 09:40:05,108 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-28 09:40:05,108 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-28 09:40:05,109 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-28 09:40:05,109 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-28 09:40:05,110 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-28 09:40:05,110 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-28 09:40:05,111 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-28 09:40:05,111 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-28 09:40:05,112 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-28 09:40:05,112 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-28 09:40:05,113 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-28 09:40:05,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:05,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 09:40:05,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 09:40:05,114 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-28 09:40:05,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:40:05,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 09:40:05,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 09:40:05,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:05,506 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-28 09:40:05,506 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-28 09:40:05,509 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-28 09:40:05,510 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-28 09:40:05,511 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-28 09:40:05,513 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-28 09:40:05,513 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-28 09:40:05,515 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-28 09:40:05,516 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-28 09:40:05,516 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-28 09:40:05,518 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-28 09:40:05,519 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-28 09:40:05,519 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-28 09:40:05,520 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-28 09:40:05,522 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-28 09:40:05,522 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-28 09:40:05,523 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-28 09:40:05,523 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-28 09:40:05,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-28 09:40:05,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 09:40:05,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 09:40:05,523 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-28 09:40:05,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-28 09:40:05,524 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-28 09:40:05,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768610941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:40:05,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:40:05,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-04-28 09:40:05,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038707632] [2022-04-28 09:40:05,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038707632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:05,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:05,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:40:05,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216663816] [2022-04-28 09:40:05,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:05,525 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-28 09:40:05,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:05,526 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-28 09:40:05,552 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-28 09:40:05,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:40:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:40:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2022-04-28 09:40:05,554 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-28 09:40:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:06,062 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:40:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:40:06,063 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-28 09:40:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:06,063 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-28 09:40:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-28 09:40:06,064 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-28 09:40:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-28 09:40:06,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 19 transitions. [2022-04-28 09:40:06,085 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-28 09:40:06,086 INFO L225 Difference]: With dead ends: 27 [2022-04-28 09:40:06,086 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:40:06,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 09:40:06,087 INFO L413 NwaCegarLoop]: 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-28 09:40:06,087 INFO L414 NwaCegarLoop]: 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-28 09:40:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:40:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:40:06,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:06,088 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-28 09:40:06,088 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-28 09:40:06,088 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-28 09:40:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:06,089 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:40:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:40:06,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:06,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:06,089 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-28 09:40:06,089 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-28 09:40:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:06,089 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:40:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:40:06,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:06,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:06,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:06,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:06,090 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-28 09:40:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:40:06,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-28 09:40:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:06,090 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:40:06,090 INFO L496 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-28 09:40:06,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:40:06,090 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-28 09:40:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:40:06,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:06,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:40:06,116 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-28 09:40:06,307 WARN L477 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-28 09:40:06,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:40:06,636 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:40:06,636 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:40:06,636 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:40:06,636 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:40:06,636 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:40:06,636 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:40:06,636 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:40:06,636 INFO L895 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-28 09:40:06,637 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 49) the Hoare annotation is: true [2022-04-28 09:40:06,637 INFO L895 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-28 09:40:06,637 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 49) the Hoare annotation is: true [2022-04-28 09:40:06,637 INFO L895 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-28 09:40:06,637 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 49) the Hoare annotation is: true [2022-04-28 09:40:06,637 INFO L902 garLoopResultBuilder]: At program point L45(lines 45 47) the Hoare annotation is: true [2022-04-28 09:40:06,637 INFO L895 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-28 09:40:06,637 INFO L895 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-28 09:40:06,637 INFO L895 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-28 09:40:06,637 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:40:06,637 INFO L895 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-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 09:40:06,638 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:40:06,638 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:40:06,638 INFO L895 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-28 09:40:06,641 INFO L356 BasicCegarLoop]: Path program histogram: [8, 2, 2, 2, 2] [2022-04-28 09:40:06,643 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:40:06,647 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:40:06,647 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:40:06,648 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:40:06,649 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:40:06,649 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:40:06,649 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:40:06,651 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:40:06,665 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-28 09:40:06,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:40:06 BoogieIcfgContainer [2022-04-28 09:40:06,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:40:06,673 INFO L158 Benchmark]: Toolchain (without parser) took 10176.81ms. Allocated memory was 172.0MB in the beginning and 250.6MB in the end (delta: 78.6MB). Free memory was 123.8MB in the beginning and 182.2MB in the end (delta: -58.4MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2022-04-28 09:40:06,673 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:40:06,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.53ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 148.2MB in the end (delta: -24.5MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-28 09:40:06,673 INFO L158 Benchmark]: Boogie Preprocessor took 24.30ms. Allocated memory is still 172.0MB. Free memory was 148.2MB in the beginning and 146.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:40:06,674 INFO L158 Benchmark]: RCFGBuilder took 274.82ms. Allocated memory is still 172.0MB. Free memory was 146.8MB in the beginning and 135.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:40:06,674 INFO L158 Benchmark]: TraceAbstraction took 9646.83ms. Allocated memory was 172.0MB in the beginning and 250.6MB in the end (delta: 78.6MB). Free memory was 134.7MB in the beginning and 182.2MB in the end (delta: -47.5MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. [2022-04-28 09:40:06,679 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.53ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 148.2MB in the end (delta: -24.5MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.30ms. Allocated memory is still 172.0MB. Free memory was 148.2MB in the beginning and 146.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.82ms. Allocated memory is still 172.0MB. Free memory was 146.8MB in the beginning and 135.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9646.83ms. Allocated memory was 172.0MB in the beginning and 250.6MB in the end (delta: 78.6MB). Free memory was 134.7MB in the beginning and 182.2MB in the end (delta: -47.5MB). Peak memory consumption was 31.6MB. 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: 9.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.5s 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, 2.1s 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.1s 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-28 09:40:06,703 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...