/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-acceleration/simple_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:18:04,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:18:04,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:18:04,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:18:04,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:18:04,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:18:04,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:18:04,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:18:04,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:18:04,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:18:04,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:18:04,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:18:04,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:18:04,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:18:04,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:18:04,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:18:04,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:18:04,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:18:04,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:18:04,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:18:04,843 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:18:04,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:18:04,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:18:04,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:18:04,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:18:04,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:18:04,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:18:04,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:18:04,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:18:04,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:18:04,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:18:04,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:18:04,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:18:04,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:18:04,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:18:04,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:18:04,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:18:04,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:18:04,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:18:04,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:18:04,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:18:04,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:18:04,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:18:04,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:18:04,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:18:04,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:18:04,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:18:04,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:18:04,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:18:04,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:18:04,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:18:04,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:04,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:18:04,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:18:04,866 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:18:04,866 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:18:04,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:18:04,866 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:18:04,866 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:18:05,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:18:05,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:18:05,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:18:05,092 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:18:05,095 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:18:05,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2022-04-15 12:18:05,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc9d270f/52af9b1f7a9c4aad81470dd30d952221/FLAGe613d94a4 [2022-04-15 12:18:05,534 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:18:05,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2022-04-15 12:18:05,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc9d270f/52af9b1f7a9c4aad81470dd30d952221/FLAGe613d94a4 [2022-04-15 12:18:05,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc9d270f/52af9b1f7a9c4aad81470dd30d952221 [2022-04-15 12:18:05,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:18:05,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:18:05,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:05,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:18:05,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:18:05,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:05" (1/1) ... [2022-04-15 12:18:05,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330c3e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:05, skipping insertion in model container [2022-04-15 12:18:05,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:05" (1/1) ... [2022-04-15 12:18:06,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:18:06,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:18:06,146 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-acceleration/simple_4-1.c[322,335] [2022-04-15 12:18:06,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:06,174 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:18:06,182 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-acceleration/simple_4-1.c[322,335] [2022-04-15 12:18:06,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:06,195 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:18:06,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06 WrapperNode [2022-04-15 12:18:06,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:06,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:18:06,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:18:06,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:18:06,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:18:06,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:18:06,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:18:06,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:18:06,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (1/1) ... [2022-04-15 12:18:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:06,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:06,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:18:06,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:18:06,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:18:06,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:18:06,286 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:18:06,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:18:06,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:18:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:18:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:18:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:18:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:18:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:18:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:18:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:18:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:18:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:18:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:18:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:18:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:18:06,338 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:18:06,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:18:06,408 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:18:06,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:18:06,431 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:18:06,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:06 BoogieIcfgContainer [2022-04-15 12:18:06,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:18:06,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:18:06,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:18:06,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:18:06,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:18:05" (1/3) ... [2022-04-15 12:18:06,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c377a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:06, skipping insertion in model container [2022-04-15 12:18:06,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:06" (2/3) ... [2022-04-15 12:18:06,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c377a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:06, skipping insertion in model container [2022-04-15 12:18:06,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:06" (3/3) ... [2022-04-15 12:18:06,452 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_4-1.c [2022-04-15 12:18:06,456 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:18:06,457 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:18:06,536 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:18:06,541 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:18:06,542 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:18:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-15 12:18:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:18:06,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:06,575 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:06,581 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:06,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 12:18:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:06,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999785404] [2022-04-15 12:18:06,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:18:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 12:18:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:06,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32329133] [2022-04-15 12:18:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:06,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:06,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:06,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:18:06,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:06,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:06,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:06,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:18:06,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-15 12:18:06,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 268435441; {21#true} is VALID [2022-04-15 12:18:06,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 12:18:06,831 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-15 12:18:06,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 12:18:06,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 12:18:06,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:18:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:06,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32329133] [2022-04-15 12:18:06,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32329133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:06,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:06,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:18:06,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:06,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999785404] [2022-04-15 12:18:06,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999785404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:06,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:06,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:18:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634297778] [2022-04-15 12:18:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:18:06,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:06,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:06,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:18:06,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:06,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:18:06,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:18:06,912 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,001 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 12:18:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:18:07,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:18:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:18:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:18:07,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 12:18:07,075 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-15 12:18:07,084 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:18:07,084 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 12:18:07,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:18:07,090 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 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-15 12:18:07,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 12:18:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 12:18:07,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:07,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,115 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,115 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,117 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:18:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:07,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-15 12:18:07,118 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-15 12:18:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,120 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:18:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:07,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:07,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 12:18:07,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 12:18:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:07,124 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 12:18:07,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 12:18:07,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:18:07,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:07,139 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:07,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:18:07,140 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 12:18:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:07,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121269484] [2022-04-15 12:18:07,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:18:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 12:18:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:07,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416899078] [2022-04-15 12:18:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(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(13, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:18:07,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:18:07,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:18:07,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:07,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(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(13, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:18:07,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:18:07,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:18:07,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2022-04-15 12:18:07,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 268435441; {140#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} is VALID [2022-04-15 12:18:07,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {136#false} is VALID [2022-04-15 12:18:07,248 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-15 12:18:07,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 12:18:07,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 12:18:07,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 12:18:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:07,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:07,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416899078] [2022-04-15 12:18:07,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416899078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:07,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:07,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:07,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:07,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121269484] [2022-04-15 12:18:07,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121269484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:07,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:07,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551627633] [2022-04-15 12:18:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:18:07,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:07,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:07,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:18:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:18:07,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:18:07,264 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,336 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:18:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:18:07,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:18:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:18:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:18:07,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 12:18:07,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:07,372 INFO L225 Difference]: With dead ends: 18 [2022-04-15 12:18:07,372 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:18:07,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-15 12:18:07,375 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:07,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:18:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:18:07,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:07,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,387 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,388 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,390 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:07,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-15 12:18:07,392 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-15 12:18:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,393 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:07,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:07,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 12:18:07,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 12:18:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:07,397 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 12:18:07,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 12:18:07,413 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-15 12:18:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:18:07,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:07,414 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:07,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:18:07,415 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 12:18:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:07,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667847061] [2022-04-15 12:18:07,533 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 12:18:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:07,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234990566] [2022-04-15 12:18:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:07,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:07,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-15 12:18:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:07,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099124119] [2022-04-15 12:18:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(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(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:07,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:07,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:07,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:07,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(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(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:07,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:07,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:07,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 12:18:07,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 268435441; {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:07,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {240#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:18:07,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {235#false} is VALID [2022-04-15 12:18:07,738 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-15 12:18:07,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:18:07,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:18:07,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:18:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099124119] [2022-04-15 12:18:07,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099124119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979468878] [2022-04-15 12:18:07,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:07,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:07,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:18:07,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:07,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:07,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:18:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:07,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:07,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 12:18:07,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:07,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:07,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:07,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 12:18:07,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 268435441; {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:07,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {263#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:07,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !(~x~0 % 4294967296 > 1); {235#false} is VALID [2022-04-15 12:18:07,903 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-15 12:18:07,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:18:07,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:18:07,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:18:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:07,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:08,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:18:08,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:18:08,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {282#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:08,126 INFO L272 TraceCheckUtils]: 8: Hoare triple {290#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {286#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:08,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {290#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:08,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {294#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:08,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 268435441; {298#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:08,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 12:18:08,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:08,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:08,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:08,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 12:18:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:08,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979468878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:08,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:08,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-15 12:18:08,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:08,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667847061] [2022-04-15 12:18:08,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667847061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:08,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:08,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897089549] [2022-04-15 12:18:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:08,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:18:08,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:08,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:08,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:18:08,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:08,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:18:08,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:18:08,149 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:08,242 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:18:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:18:08,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:18:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:18:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:18:08,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 12:18:08,267 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-15 12:18:08,269 INFO L225 Difference]: With dead ends: 19 [2022-04-15 12:18:08,269 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:18:08,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:18:08,277 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:08,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:18:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:18:08,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:08,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,289 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,289 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:08,290 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:18:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:08,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:08,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:08,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:18:08,291 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:18:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:08,293 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:18:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:08,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:08,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:08,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:08,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 12:18:08,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 12:18:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:08,295 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 12:18:08,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 12:18:08,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:18:08,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:08,310 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:08,339 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-15 12:18:08,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:08,531 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-15 12:18:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:08,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993660195] [2022-04-15 12:18:08,593 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-15 12:18:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:08,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924960140] [2022-04-15 12:18:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:08,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:08,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:08,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-15 12:18:08,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:08,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545259874] [2022-04-15 12:18:08,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:08,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(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(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 12:18:08,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 12:18:08,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 12:18:08,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:08,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(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(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 12:18:08,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 12:18:08,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 12:18:08,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-15 12:18:08,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 268435441; {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:08,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:08,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435437 main_~x~0))} is VALID [2022-04-15 12:18:08,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435437 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {418#false} is VALID [2022-04-15 12:18:08,753 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-15 12:18:08,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-15 12:18:08,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-15 12:18:08,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 12:18:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:08,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545259874] [2022-04-15 12:18:08,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545259874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:08,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595641704] [2022-04-15 12:18:08,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:08,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:08,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:08,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:08,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:18:08,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:08,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:08,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:18:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:09,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-15 12:18:09,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#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(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 12:18:09,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 12:18:09,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 12:18:09,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-15 12:18:09,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 268435441; {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:09,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:09,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {450#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:09,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !(~x~0 % 4294967296 > 1); {418#false} is VALID [2022-04-15 12:18:09,040 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-15 12:18:09,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-15 12:18:09,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-15 12:18:09,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 12:18:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:09,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:09,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 12:18:09,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-15 12:18:09,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-15 12:18:09,126 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-15 12:18:09,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {418#false} is VALID [2022-04-15 12:18:09,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {478#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:09,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {482#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:09,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 268435441; {486#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:09,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-15 12:18:09,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 12:18:09,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 12:18:09,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#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(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 12:18:09,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-15 12:18:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:09,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595641704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:09,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:09,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 12:18:09,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:09,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993660195] [2022-04-15 12:18:09,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993660195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:09,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:09,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:18:09,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645226016] [2022-04-15 12:18:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:09,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-15 12:18:09,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:09,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-15 12:18:09,148 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-15 12:18:09,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:18:09,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:09,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:18:09,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:18:09,150 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-15 12:18:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:09,255 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:18:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:18:09,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-15 12:18:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-15 12:18:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:18:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-15 12:18:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:18:09,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 12:18:09,281 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-15 12:18:09,282 INFO L225 Difference]: With dead ends: 20 [2022-04-15 12:18:09,282 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:18:09,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:18:09,284 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:09,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:18:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:18:09,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:09,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,295 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,295 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:09,298 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:18:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:18:09,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:09,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:09,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-15 12:18:09,299 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-15 12:18:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:09,303 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:18:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:18:09,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:09,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:09,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:09,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:18:09,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 12:18:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:09,306 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:18:09,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-15 12:18:09,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:18:09,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:18:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:18:09,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:09,322 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:09,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:09,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 12:18:09,537 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:09,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-15 12:18:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:09,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [472765648] [2022-04-15 12:18:09,597 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-15 12:18:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:09,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615908599] [2022-04-15 12:18:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:09,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:09,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-15 12:18:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:09,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581451640] [2022-04-15 12:18:09,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:09,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {622#(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(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 12:18:09,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 12:18:09,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 12:18:09,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:09,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#(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(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 12:18:09,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 12:18:09,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 12:18:09,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-15 12:18:09,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~x~0 := 268435441; {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:09,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:09,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:09,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {621#(and (<= (div main_~x~0 4294967296) 0) (<= 268435435 main_~x~0))} is VALID [2022-04-15 12:18:09,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#(and (<= (div main_~x~0 4294967296) 0) (<= 268435435 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {614#false} is VALID [2022-04-15 12:18:09,781 INFO L272 TraceCheckUtils]: 10: Hoare triple {614#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {614#false} is VALID [2022-04-15 12:18:09,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2022-04-15 12:18:09,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2022-04-15 12:18:09,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-15 12:18:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581451640] [2022-04-15 12:18:09,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581451640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:09,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212151027] [2022-04-15 12:18:09,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:09,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:09,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:09,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:09,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:18:09,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:18:09,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:09,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:18:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:09,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:09,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-15 12:18:09,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#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(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 12:18:09,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 12:18:09,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 12:18:09,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-15 12:18:09,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~x~0 := 268435441; {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:09,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:09,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:09,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {650#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:09,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !(~x~0 % 4294967296 > 1); {614#false} is VALID [2022-04-15 12:18:09,902 INFO L272 TraceCheckUtils]: 10: Hoare triple {614#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {614#false} is VALID [2022-04-15 12:18:09,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2022-04-15 12:18:09,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2022-04-15 12:18:09,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-15 12:18:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:09,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:10,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-15 12:18:10,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {669#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {614#false} is VALID [2022-04-15 12:18:10,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {669#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:10,148 INFO L272 TraceCheckUtils]: 10: Hoare triple {677#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {673#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:10,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {677#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:10,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {681#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:10,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {685#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:10,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {689#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:10,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~x~0 := 268435441; {693#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:10,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-15 12:18:10,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 12:18:10,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 12:18:10,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#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(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 12:18:10,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-15 12:18:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:10,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212151027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:10,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:10,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 15 [2022-04-15 12:18:10,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [472765648] [2022-04-15 12:18:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [472765648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:10,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:18:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46965651] [2022-04-15 12:18:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:10,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-15 12:18:10,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:10,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-15 12:18:10,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:10,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:18:10,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:18:10,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:18:10,174 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-15 12:18:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:10,315 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:18:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:18:10,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-15 12:18:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-15 12:18:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:18:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-15 12:18:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:18:10,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 12:18:10,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:10,345 INFO L225 Difference]: With dead ends: 21 [2022-04-15 12:18:10,345 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:18:10,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:18:10,346 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:10,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:18:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:18:10,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:10,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,358 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,358 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:10,359 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:18:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:18:10,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:10,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:10,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-15 12:18:10,360 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-15 12:18:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:10,363 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:18:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:18:10,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:10,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:10,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:10,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 12:18:10,364 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 12:18:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:10,365 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 12:18:10,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-15 12:18:10,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 12:18:10,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:18:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:18:10,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:10,382 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:10,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:10,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:10,582 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-15 12:18:10,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:10,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245729449] [2022-04-15 12:18:10,634 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-15 12:18:10,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:10,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053975492] [2022-04-15 12:18:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:10,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:10,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-15 12:18:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:10,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340198678] [2022-04-15 12:18:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:10,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:10,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#(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(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 12:18:10,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 12:18:10,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 12:18:10,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:10,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#(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(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 12:18:10,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 12:18:10,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 12:18:10,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-15 12:18:10,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {828#true} ~x~0 := 268435441; {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:10,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:10,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:10,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:10,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {837#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:10,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {829#false} is VALID [2022-04-15 12:18:10,789 INFO L272 TraceCheckUtils]: 11: Hoare triple {829#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {829#false} is VALID [2022-04-15 12:18:10,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2022-04-15 12:18:10,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#false} assume 0 == ~cond; {829#false} is VALID [2022-04-15 12:18:10,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-15 12:18:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340198678] [2022-04-15 12:18:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340198678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:10,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646312836] [2022-04-15 12:18:10,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:10,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:10,791 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:10,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:18:10,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:10,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:10,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:18:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:10,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:10,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2022-04-15 12:18:10,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#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(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 12:18:10,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 12:18:10,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 12:18:10,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-15 12:18:10,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {828#true} ~x~0 := 268435441; {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:10,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:10,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:10,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:10,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {869#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:10,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {869#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {829#false} is VALID [2022-04-15 12:18:10,931 INFO L272 TraceCheckUtils]: 11: Hoare triple {829#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {829#false} is VALID [2022-04-15 12:18:10,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2022-04-15 12:18:10,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#false} assume 0 == ~cond; {829#false} is VALID [2022-04-15 12:18:10,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-15 12:18:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:10,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:11,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-15 12:18:11,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {888#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {829#false} is VALID [2022-04-15 12:18:11,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {892#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {888#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:11,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {896#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {892#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:11,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {900#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {896#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:11,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {904#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {900#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:11,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {904#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:11,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {908#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:11,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {912#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:11,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {828#true} ~x~0 := 268435441; {916#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:11,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-15 12:18:11,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 12:18:11,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 12:18:11,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#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(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 12:18:11,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2022-04-15 12:18:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:11,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646312836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:11,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:11,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2022-04-15 12:18:11,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245729449] [2022-04-15 12:18:11,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245729449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:11,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:11,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:18:11,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425794438] [2022-04-15 12:18:11,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-15 12:18:11,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:11,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:11,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:18:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:18:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:18:11,220 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:11,385 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:18:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:18:11,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-15 12:18:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:18:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:18:11,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 12:18:11,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:11,408 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:18:11,408 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:18:11,409 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:18:11,409 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:11,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:18:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:18:11,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:11,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,420 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,421 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:11,422 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:18:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:18:11,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:11,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:11,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:18:11,422 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:18:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:11,423 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:18:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:18:11,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:11,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:11,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:11,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:11,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 12:18:11,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 12:18:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:11,425 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 12:18:11,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 12:18:11,441 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-15 12:18:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:18:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:18:11,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:11,442 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:11,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:11,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:11,663 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-15 12:18:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305319046] [2022-04-15 12:18:11,711 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-15 12:18:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801569488] [2022-04-15 12:18:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:11,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:11,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-15 12:18:11,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:11,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656421602] [2022-04-15 12:18:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:11,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {1070#(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(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 12:18:11,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 12:18:11,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 12:18:11,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:11,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#(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(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 12:18:11,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 12:18:11,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 12:18:11,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-15 12:18:11,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1059#true} ~x~0 := 268435441; {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:11,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:11,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:11,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:11,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:11,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1069#(and (<= 268435431 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:18:11,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(and (<= 268435431 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {1060#false} is VALID [2022-04-15 12:18:11,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {1060#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1060#false} is VALID [2022-04-15 12:18:11,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-15 12:18:11,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-15 12:18:11,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-15 12:18:11,898 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-15 12:18:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:11,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656421602] [2022-04-15 12:18:11,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656421602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:11,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058718997] [2022-04-15 12:18:11,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:11,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:11,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:11,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:18:11,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:11,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:11,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 12:18:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:11,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:12,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2022-04-15 12:18:12,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#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(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 12:18:12,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 12:18:12,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 12:18:12,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-15 12:18:12,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1059#true} ~x~0 := 268435441; {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:12,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:12,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:12,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:12,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:12,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1104#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:12,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1104#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !(~x~0 % 4294967296 > 1); {1060#false} is VALID [2022-04-15 12:18:12,169 INFO L272 TraceCheckUtils]: 12: Hoare triple {1060#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1060#false} is VALID [2022-04-15 12:18:12,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-15 12:18:12,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-15 12:18:12,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-15 12:18:12,169 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-15 12:18:12,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:12,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-15 12:18:12,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-15 12:18:12,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-15 12:18:12,316 INFO L272 TraceCheckUtils]: 12: Hoare triple {1060#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1060#false} is VALID [2022-04-15 12:18:12,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {1060#false} is VALID [2022-04-15 12:18:12,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {1136#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1132#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:12,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {1140#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1136#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:12,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {1144#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1140#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:12,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {1148#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1144#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:12,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {1152#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1148#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:12,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {1059#true} ~x~0 := 268435441; {1152#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:12,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-15 12:18:12,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 12:18:12,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 12:18:12,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#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(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 12:18:12,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2022-04-15 12:18:12,326 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-15 12:18:12,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058718997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:12,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:12,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 12:18:12,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:12,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305319046] [2022-04-15 12:18:12,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305319046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:12,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:12,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:18:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997583490] [2022-04-15 12:18:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:12,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 16 [2022-04-15 12:18:12,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:12,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-15 12:18:12,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:12,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:18:12,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:12,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:18:12,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:18:12,343 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-15 12:18:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:12,578 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:18:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:18:12,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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 16 [2022-04-15 12:18:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-15 12:18:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:18:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-15 12:18:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:18:12,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 12:18:12,598 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-15 12:18:12,599 INFO L225 Difference]: With dead ends: 23 [2022-04-15 12:18:12,599 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:18:12,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:18:12,600 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:12,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:18:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:18:12,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:12,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 12:18:12,616 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 12:18:12,616 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 12:18:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:12,617 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:18:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:18:12,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:12,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:12,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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 18 states. [2022-04-15 12:18:12,618 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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 18 states. [2022-04-15 12:18:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:12,618 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:18:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:18:12,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:12,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:12,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:12,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 12:18:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 12:18:12,620 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 12:18:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:12,620 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 12:18:12,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-15 12:18:12,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 12:18:12,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:18:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:18:12,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:12,638 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:12,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:12,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2022-04-15 12:18:12,848 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-15 12:18:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:12,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404997127] [2022-04-15 12:18:12,892 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-15 12:18:12,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:12,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971029271] [2022-04-15 12:18:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:12,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:12,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-15 12:18:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915305886] [2022-04-15 12:18:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:12,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:13,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {1315#(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(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 12:18:13,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 12:18:13,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 12:18:13,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:13,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#(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(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 12:18:13,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 12:18:13,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 12:18:13,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-15 12:18:13,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#true} ~x~0 := 268435441; {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:13,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:13,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:13,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:13,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:13,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:13,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1314#(and (<= (div main_~x~0 4294967296) 0) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:13,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(and (<= (div main_~x~0 4294967296) 0) (<= 268435429 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1304#false} is VALID [2022-04-15 12:18:13,074 INFO L272 TraceCheckUtils]: 13: Hoare triple {1304#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1304#false} is VALID [2022-04-15 12:18:13,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#false} ~cond := #in~cond; {1304#false} is VALID [2022-04-15 12:18:13,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {1304#false} assume 0 == ~cond; {1304#false} is VALID [2022-04-15 12:18:13,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-15 12:18:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:13,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915305886] [2022-04-15 12:18:13,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915305886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:13,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815454731] [2022-04-15 12:18:13,075 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:13,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:13,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:13,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:13,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:18:13,142 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:18:13,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:13,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:18:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:13,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:13,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1303#true} is VALID [2022-04-15 12:18:13,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#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(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 12:18:13,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 12:18:13,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 12:18:13,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-15 12:18:13,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#true} ~x~0 := 268435441; {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:13,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:13,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:13,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:13,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:13,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:13,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1352#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:13,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {1352#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1304#false} is VALID [2022-04-15 12:18:13,257 INFO L272 TraceCheckUtils]: 13: Hoare triple {1304#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1304#false} is VALID [2022-04-15 12:18:13,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#false} ~cond := #in~cond; {1304#false} is VALID [2022-04-15 12:18:13,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {1304#false} assume 0 == ~cond; {1304#false} is VALID [2022-04-15 12:18:13,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-15 12:18:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:13,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:13,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-15 12:18:13,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1304#false} is VALID [2022-04-15 12:18:13,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1371#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:13,617 INFO L272 TraceCheckUtils]: 13: Hoare triple {1379#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1375#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:13,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {1383#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {1379#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:13,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {1387#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1383#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:13,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {1391#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1387#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:13,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {1395#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1391#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:13,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {1399#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1395#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:13,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1399#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:13,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1403#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:13,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#true} ~x~0 := 268435441; {1407#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:13,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-15 12:18:13,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 12:18:13,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 12:18:13,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#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(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 12:18:13,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1303#true} is VALID [2022-04-15 12:18:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:13,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815454731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:13,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:13,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 21 [2022-04-15 12:18:13,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:13,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404997127] [2022-04-15 12:18:13,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404997127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:13,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:13,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:18:13,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758413401] [2022-04-15 12:18:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:18:13,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:13,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:18:13,649 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-15 12:18:13,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:18:13,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:13,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:18:13,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:18:13,650 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:18:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:13,930 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:18:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:18:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:18:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:18:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 12:18:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:18:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 12:18:13,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 12:18:13,954 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-15 12:18:13,955 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:18:13,955 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:18:13,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:18:13,956 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:13,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:18:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:18:13,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:13,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:13,972 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:13,972 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:13,973 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:18:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:18:13,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:13,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:13,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 19 states. [2022-04-15 12:18:13,973 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 19 states. [2022-04-15 12:18:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:13,974 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:18:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:18:13,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:13,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:13,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:13,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 12:18:13,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 12:18:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:13,976 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 12:18:13,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 12:18:13,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 12:18:13,993 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-15 12:18:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:18:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:18:13,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:13,994 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:14,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:14,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:14,199 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 13 times [2022-04-15 12:18:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:14,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559170705] [2022-04-15 12:18:14,248 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-15 12:18:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:14,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276322284] [2022-04-15 12:18:14,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:14,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:14,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:14,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 14 times [2022-04-15 12:18:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:14,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549470822] [2022-04-15 12:18:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {1579#(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(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 12:18:14,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 12:18:14,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 12:18:14,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:14,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#(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(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 12:18:14,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 12:18:14,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 12:18:14,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-15 12:18:14,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~x~0 := 268435441; {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:14,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:14,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:14,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:14,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:14,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:14,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:14,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1578#(and (<= (div main_~x~0 4294967296) 0) (<= 268435427 main_~x~0))} is VALID [2022-04-15 12:18:14,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {1578#(and (<= (div main_~x~0 4294967296) 0) (<= 268435427 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1567#false} is VALID [2022-04-15 12:18:14,412 INFO L272 TraceCheckUtils]: 14: Hoare triple {1567#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1567#false} is VALID [2022-04-15 12:18:14,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-15 12:18:14,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 12:18:14,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 12:18:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:14,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549470822] [2022-04-15 12:18:14,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549470822] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:14,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335248349] [2022-04-15 12:18:14,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:14,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:14,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:14,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:14,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:18:14,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:14,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:14,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:18:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:14,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 12:18:14,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 12:18:14,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 12:18:14,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 12:18:14,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-15 12:18:14,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~x~0 := 268435441; {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:14,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:14,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:14,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:14,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:14,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:14,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:14,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1619#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:14,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1619#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !(~x~0 % 4294967296 > 1); {1567#false} is VALID [2022-04-15 12:18:14,585 INFO L272 TraceCheckUtils]: 14: Hoare triple {1567#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1567#false} is VALID [2022-04-15 12:18:14,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-15 12:18:14,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 12:18:14,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 12:18:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:14,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:14,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 12:18:14,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {1638#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 12:18:14,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {1642#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1638#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:14,972 INFO L272 TraceCheckUtils]: 14: Hoare triple {1646#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1642#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:14,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {1646#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1650#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1654#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {1662#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1658#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1662#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {1670#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1666#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {1674#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1670#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {1678#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1674#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~x~0 := 268435441; {1678#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:14,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-15 12:18:14,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 12:18:14,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 12:18:14,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 12:18:14,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 12:18:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:14,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335248349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:14,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:14,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2022-04-15 12:18:14,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:14,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559170705] [2022-04-15 12:18:14,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559170705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:14,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:14,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:18:14,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851759258] [2022-04-15 12:18:14,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:14,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-15 12:18:14,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:14,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:15,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:15,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:18:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:15,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:18:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:18:15,001 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:15,320 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:18:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:18:15,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-15 12:18:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 12:18:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 12:18:15,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-15 12:18:15,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:15,347 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:18:15,347 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:18:15,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:18:15,348 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:15,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:18:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 12:18:15,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:15,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 12:18:15,365 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 12:18:15,365 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 12:18:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:15,367 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:18:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:18:15,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:15,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:15,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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 20 states. [2022-04-15 12:18:15,370 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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 20 states. [2022-04-15 12:18:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:15,370 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:18:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:18:15,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:15,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:15,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:15,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-15 12:18:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 12:18:15,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 12:18:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:15,372 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 12:18:15,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:15,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 12:18:15,391 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-15 12:18:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:18:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:18:15,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:15,392 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:15,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:15,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:15,593 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 15 times [2022-04-15 12:18:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:15,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74920505] [2022-04-15 12:18:15,635 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-15 12:18:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:15,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952429792] [2022-04-15 12:18:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:15,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:15,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 16 times [2022-04-15 12:18:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:15,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860122600] [2022-04-15 12:18:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:15,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {1859#(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(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 12:18:15,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 12:18:15,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 12:18:15,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:15,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1859#(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(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 12:18:15,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 12:18:15,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 12:18:15,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-15 12:18:15,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1845#true} ~x~0 := 268435441; {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:15,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:15,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:15,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:15,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:15,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:15,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:15,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:15,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1858#(and (<= (div main_~x~0 4294967296) 0) (<= 268435425 main_~x~0))} is VALID [2022-04-15 12:18:15,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {1858#(and (<= (div main_~x~0 4294967296) 0) (<= 268435425 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1846#false} is VALID [2022-04-15 12:18:15,854 INFO L272 TraceCheckUtils]: 15: Hoare triple {1846#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1846#false} is VALID [2022-04-15 12:18:15,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-15 12:18:15,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-15 12:18:15,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-15 12:18:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:15,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:15,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860122600] [2022-04-15 12:18:15,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860122600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:15,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201052304] [2022-04-15 12:18:15,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:15,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:15,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:15,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:15,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:18:15,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:15,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:15,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:18:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:15,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:16,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1845#true} is VALID [2022-04-15 12:18:16,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1845#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(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 12:18:16,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 12:18:16,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 12:18:16,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-15 12:18:16,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {1845#true} ~x~0 := 268435441; {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:16,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:16,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:16,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:16,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:16,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:16,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:16,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:16,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:16,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !(~x~0 % 4294967296 > 1); {1846#false} is VALID [2022-04-15 12:18:16,146 INFO L272 TraceCheckUtils]: 15: Hoare triple {1846#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1846#false} is VALID [2022-04-15 12:18:16,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-15 12:18:16,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-15 12:18:16,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-15 12:18:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:16,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:16,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-15 12:18:16,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-15 12:18:16,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-15 12:18:16,383 INFO L272 TraceCheckUtils]: 15: Hoare triple {1846#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1846#false} is VALID [2022-04-15 12:18:16,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {1930#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {1846#false} is VALID [2022-04-15 12:18:16,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {1934#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1930#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:16,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {1938#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1934#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:16,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1938#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:16,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {1946#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1942#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:16,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1950#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1946#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:16,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {1954#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1950#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:16,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1954#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:18:16,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {1962#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1958#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:16,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {1845#true} ~x~0 := 268435441; {1962#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:18:16,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-15 12:18:16,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 12:18:16,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 12:18:16,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1845#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(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 12:18:16,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1845#true} is VALID [2022-04-15 12:18:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:16,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201052304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:16,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:16,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 12:18:16,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:16,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74920505] [2022-04-15 12:18:16,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74920505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:16,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:16,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:18:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937394643] [2022-04-15 12:18:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 19 [2022-04-15 12:18:16,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:16,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,411 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-15 12:18:16,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:18:16,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:16,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:18:16,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:18:16,412 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:16,768 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:18:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:18:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 19 [2022-04-15 12:18:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 12:18:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 12:18:16,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-15 12:18:16,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:16,795 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:18:16,795 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:18:16,795 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:18:16,796 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:16,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:18:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:18:16,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:16,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,812 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,813 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:16,813 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:18:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:18:16,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:16,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:16,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-15 12:18:16,814 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-15 12:18:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:16,815 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:18:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:18:16,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:16,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:16,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:16,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 12:18:16,816 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 12:18:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:16,816 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 12:18:16,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:16,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 12:18:16,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:18:16,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:18:16,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:16,839 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:16,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:17,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2022-04-15 12:18:17,043 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 17 times [2022-04-15 12:18:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:17,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060567395] [2022-04-15 12:18:17,088 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:17,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-15 12:18:17,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:17,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378849910] [2022-04-15 12:18:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:17,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:17,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 18 times [2022-04-15 12:18:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:17,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45398663] [2022-04-15 12:18:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:17,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:17,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {2152#(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(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 12:18:17,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 12:18:17,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 12:18:17,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:17,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {2152#(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(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 12:18:17,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 12:18:17,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 12:18:17,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-15 12:18:17,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#true} ~x~0 := 268435441; {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:17,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:17,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:17,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:17,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:17,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:17,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:17,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:17,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:17,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:17,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {2151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435423 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2138#false} is VALID [2022-04-15 12:18:17,297 INFO L272 TraceCheckUtils]: 16: Hoare triple {2138#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2138#false} is VALID [2022-04-15 12:18:17,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2022-04-15 12:18:17,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2022-04-15 12:18:17,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-15 12:18:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45398663] [2022-04-15 12:18:17,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45398663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474795577] [2022-04-15 12:18:17,297 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:17,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:17,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:17,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:17,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:18:17,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:18:17,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:17,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:18:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:17,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:17,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2137#true} is VALID [2022-04-15 12:18:17,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#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(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 12:18:17,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 12:18:17,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 12:18:17,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-15 12:18:17,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#true} ~x~0 := 268435441; {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:17,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:17,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:17,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:17,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:17,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:17,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:17,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:17,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:17,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2198#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:17,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {2198#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2138#false} is VALID [2022-04-15 12:18:17,520 INFO L272 TraceCheckUtils]: 16: Hoare triple {2138#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2138#false} is VALID [2022-04-15 12:18:17,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2022-04-15 12:18:17,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2022-04-15 12:18:17,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-15 12:18:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:17,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:18,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-15 12:18:18,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2138#false} is VALID [2022-04-15 12:18:18,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {2221#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2217#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:18,075 INFO L272 TraceCheckUtils]: 16: Hoare triple {2225#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2221#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:18,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {2229#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {2225#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:18,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {2233#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2229#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {2237#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2233#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {2241#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2237#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {2245#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2241#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {2249#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2245#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {2253#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2249#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {2257#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2253#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2257#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {2265#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2261#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#true} ~x~0 := 268435441; {2265#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:18,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-15 12:18:18,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 12:18:18,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 12:18:18,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#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(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 12:18:18,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2137#true} is VALID [2022-04-15 12:18:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:18,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474795577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:18,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:18,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 27 [2022-04-15 12:18:18,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:18,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060567395] [2022-04-15 12:18:18,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060567395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:18,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:18,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:18:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802694356] [2022-04-15 12:18:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:18,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-15 12:18:18,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:18,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-15 12:18:18,108 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-15 12:18:18,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:18:18,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:18,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:18:18,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:18:18,109 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-15 12:18:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,449 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:18:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:18:18,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-15 12:18:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-15 12:18:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 12:18:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-15 12:18:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 12:18:18,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-15 12:18:18,479 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-15 12:18:18,480 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:18:18,480 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:18:18,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:18:18,481 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:18,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:18:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:18:18,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:18,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,500 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,500 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,502 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:18:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:18:18,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 22 states. [2022-04-15 12:18:18,502 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 22 states. [2022-04-15 12:18:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,503 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:18:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:18:18,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:18,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 12:18:18,504 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 12:18:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:18,504 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 12:18:18,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-15 12:18:18,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 12:18:18,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:18:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:18:18,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:18,524 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:18,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:18,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:18,729 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 19 times [2022-04-15 12:18:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:18,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1786651748] [2022-04-15 12:18:18,767 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-15 12:18:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:18,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554885938] [2022-04-15 12:18:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:18,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:18,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:18,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 20 times [2022-04-15 12:18:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:18,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435926491] [2022-04-15 12:18:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {2464#(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(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 12:18:19,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 12:18:19,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 12:18:19,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:19,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {2464#(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(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 12:18:19,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 12:18:19,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 12:18:19,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-15 12:18:19,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} ~x~0 := 268435441; {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:19,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:19,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:19,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:19,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:19,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:19,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:19,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:19,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:19,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:19,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2463#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:18:19,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {2463#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {2449#false} is VALID [2022-04-15 12:18:19,014 INFO L272 TraceCheckUtils]: 17: Hoare triple {2449#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2449#false} is VALID [2022-04-15 12:18:19,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {2449#false} ~cond := #in~cond; {2449#false} is VALID [2022-04-15 12:18:19,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {2449#false} assume 0 == ~cond; {2449#false} is VALID [2022-04-15 12:18:19,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-15 12:18:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:19,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:19,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435926491] [2022-04-15 12:18:19,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435926491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:19,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483427524] [2022-04-15 12:18:19,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:19,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:19,020 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:18:19,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:19,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:19,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 12:18:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:19,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-15 12:18:19,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 12:18:19,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 12:18:19,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 12:18:19,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-15 12:18:19,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} ~x~0 := 268435441; {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:19,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:19,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:19,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:19,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:19,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:19,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:19,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:19,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:19,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:19,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2513#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:19,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {2513#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !(~x~0 % 4294967296 > 1); {2449#false} is VALID [2022-04-15 12:18:19,222 INFO L272 TraceCheckUtils]: 17: Hoare triple {2449#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2449#false} is VALID [2022-04-15 12:18:19,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {2449#false} ~cond := #in~cond; {2449#false} is VALID [2022-04-15 12:18:19,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {2449#false} assume 0 == ~cond; {2449#false} is VALID [2022-04-15 12:18:19,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-15 12:18:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:19,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:19,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-15 12:18:19,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {2532#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2449#false} is VALID [2022-04-15 12:18:19,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2532#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:19,804 INFO L272 TraceCheckUtils]: 17: Hoare triple {2540#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2536#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:19,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {2544#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {2540#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:19,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2544#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {2552#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2548#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2552#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2556#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {2564#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2560#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {2568#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2564#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2568#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {2576#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2572#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {2580#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2576#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {2584#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2580#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} ~x~0 := 268435441; {2584#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:19,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-15 12:18:19,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 12:18:19,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 12:18:19,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 12:18:19,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-15 12:18:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:19,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483427524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:19,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:19,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 29 [2022-04-15 12:18:19,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:19,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1786651748] [2022-04-15 12:18:19,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1786651748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:19,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:19,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:18:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431817987] [2022-04-15 12:18:19,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:19,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 21 [2022-04-15 12:18:19,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:19,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:19,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:18:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:18:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:18:19,836 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:20,243 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:18:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:18:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 21 [2022-04-15 12:18:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 12:18:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 12:18:20,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-15 12:18:20,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:20,270 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:18:20,270 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:18:20,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:18:20,271 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:20,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:18:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:18:20,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:20,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-15 12:18:20,291 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-15 12:18:20,291 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-15 12:18:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:20,292 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:18:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:18:20,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:20,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:20,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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 23 states. [2022-04-15 12:18:20,292 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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 23 states. [2022-04-15 12:18:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:20,293 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:18:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:18:20,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:20,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:20,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:20,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-15 12:18:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 12:18:20,294 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 12:18:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:20,294 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 12:18:20,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 12:18:20,317 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-15 12:18:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:18:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:18:20,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:20,318 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:20,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:20,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21 [2022-04-15 12:18:20,518 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 21 times [2022-04-15 12:18:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:20,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243950994] [2022-04-15 12:18:20,557 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-15 12:18:20,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:20,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187511501] [2022-04-15 12:18:20,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:20,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:20,567 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:20,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 22 times [2022-04-15 12:18:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:20,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481679582] [2022-04-15 12:18:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {2792#(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(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 12:18:20,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 12:18:20,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 12:18:20,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:20,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#(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(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 12:18:20,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 12:18:20,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 12:18:20,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-15 12:18:20,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {2775#true} ~x~0 := 268435441; {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:20,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:20,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:20,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:20,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:20,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:20,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:20,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:20,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:20,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:20,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:20,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2791#(and (<= 268435419 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:18:20,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {2791#(and (<= 268435419 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {2776#false} is VALID [2022-04-15 12:18:20,804 INFO L272 TraceCheckUtils]: 18: Hoare triple {2776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2776#false} is VALID [2022-04-15 12:18:20,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-15 12:18:20,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-15 12:18:20,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-15 12:18:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:20,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481679582] [2022-04-15 12:18:20,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481679582] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:20,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457225238] [2022-04-15 12:18:20,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:20,807 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:20,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:18:20,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:20,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:20,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:18:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:21,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2022-04-15 12:18:21,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#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(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 12:18:21,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 12:18:21,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 12:18:21,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-15 12:18:21,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {2775#true} ~x~0 := 268435441; {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:21,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:21,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:21,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:21,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:21,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:21,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:21,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:21,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:21,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:21,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:21,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2844#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:21,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !(~x~0 % 4294967296 > 1); {2776#false} is VALID [2022-04-15 12:18:21,135 INFO L272 TraceCheckUtils]: 18: Hoare triple {2776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2776#false} is VALID [2022-04-15 12:18:21,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-15 12:18:21,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-15 12:18:21,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-15 12:18:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:21,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:21,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-15 12:18:21,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-15 12:18:21,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-15 12:18:21,504 INFO L272 TraceCheckUtils]: 18: Hoare triple {2776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2776#false} is VALID [2022-04-15 12:18:21,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {2872#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {2776#false} is VALID [2022-04-15 12:18:21,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {2876#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2872#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:21,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {2880#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2876#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:21,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {2884#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2880#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:21,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {2888#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2884#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:21,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {2892#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2888#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:21,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {2896#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2892#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:21,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {2900#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2896#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:18:21,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {2904#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2900#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:21,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {2908#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2904#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:18:21,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {2912#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2908#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:18:21,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {2916#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2912#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:21,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {2775#true} ~x~0 := 268435441; {2916#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:21,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-15 12:18:21,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 12:18:21,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 12:18:21,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#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(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 12:18:21,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2022-04-15 12:18:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:21,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457225238] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:21,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:21,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 12:18:21,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:21,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243950994] [2022-04-15 12:18:21,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243950994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:21,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:21,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:18:21,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372384951] [2022-04-15 12:18:21,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:21,516 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-15 12:18:21,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:21,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:21,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:18:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:18:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:18:21,532 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:22,031 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:18:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:18:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-15 12:18:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 12:18:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 12:18:22,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-15 12:18:22,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:22,060 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:18:22,060 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:18:22,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:18:22,061 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:22,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:18:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 12:18:22,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:22,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 12:18:22,083 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 12:18:22,083 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 12:18:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:22,084 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:18:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:18:22,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:22,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:22,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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 24 states. [2022-04-15 12:18:22,085 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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 24 states. [2022-04-15 12:18:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:22,085 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:18:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:18:22,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:22,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:22,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:22,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-15 12:18:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 12:18:22,086 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 12:18:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:22,087 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 12:18:22,087 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 12:18:22,111 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-15 12:18:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:18:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:18:22,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:22,112 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:22,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:22,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23 [2022-04-15 12:18:22,312 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 23 times [2022-04-15 12:18:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:22,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667071021] [2022-04-15 12:18:22,349 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-15 12:18:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:22,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582723104] [2022-04-15 12:18:22,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:22,356 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:22,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 24 times [2022-04-15 12:18:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409781906] [2022-04-15 12:18:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:22,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#(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(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 12:18:22,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 12:18:22,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 12:18:22,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:22,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#(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(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 12:18:22,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 12:18:22,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 12:18:22,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-15 12:18:22,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {3115#true} ~x~0 := 268435441; {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:22,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:22,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:22,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:22,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:22,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:22,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:22,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:22,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:22,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:22,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:22,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:22,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3132#(and (<= (div main_~x~0 4294967296) 0) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:22,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(and (<= (div main_~x~0 4294967296) 0) (<= 268435417 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3116#false} is VALID [2022-04-15 12:18:22,611 INFO L272 TraceCheckUtils]: 19: Hoare triple {3116#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3116#false} is VALID [2022-04-15 12:18:22,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-15 12:18:22,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-15 12:18:22,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-15 12:18:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409781906] [2022-04-15 12:18:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409781906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559811153] [2022-04-15 12:18:22,612 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:22,613 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:18:22,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:22,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:22,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:18:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:22,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:22,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2022-04-15 12:18:22,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#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(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 12:18:22,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 12:18:22,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 12:18:22,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-15 12:18:22,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {3115#true} ~x~0 := 268435441; {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:22,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:22,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:22,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:22,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:22,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:22,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:22,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:22,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:22,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:22,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:22,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:22,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3188#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:22,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {3188#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3116#false} is VALID [2022-04-15 12:18:22,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {3116#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3116#false} is VALID [2022-04-15 12:18:22,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-15 12:18:22,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-15 12:18:22,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-15 12:18:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:22,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:23,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-15 12:18:23,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-15 12:18:23,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-15 12:18:23,413 INFO L272 TraceCheckUtils]: 19: Hoare triple {3116#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3116#false} is VALID [2022-04-15 12:18:23,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {3216#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3116#false} is VALID [2022-04-15 12:18:23,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {3220#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3216#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:23,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {3224#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3220#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:23,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {3228#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3224#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:23,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {3232#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3228#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:23,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3232#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:23,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {3240#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3236#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:23,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3240#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:18:23,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {3248#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3244#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:23,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {3252#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3248#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:18:23,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {3256#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3252#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:18:23,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {3260#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3256#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:23,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {3264#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3260#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:23,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {3115#true} ~x~0 := 268435441; {3264#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:23,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-15 12:18:23,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 12:18:23,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 12:18:23,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#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(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 12:18:23,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2022-04-15 12:18:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:23,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559811153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:23,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:23,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 12:18:23,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:23,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667071021] [2022-04-15 12:18:23,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667071021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:23,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:23,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:18:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952617574] [2022-04-15 12:18:23,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-15 12:18:23,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:23,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-15 12:18:23,442 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-15 12:18:23,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:18:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:23,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:18:23,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:18:23,443 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-15 12:18:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,058 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:18:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:18:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-15 12:18:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-15 12:18:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 12:18:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-15 12:18:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 12:18:24,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-15 12:18:24,083 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-15 12:18:24,084 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:18:24,084 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:18:24,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=497, Invalid=1309, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:18:24,085 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:24,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:18:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:18:24,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:24,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,107 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,107 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,107 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:18:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:18:24,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:24,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:24,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 25 states. [2022-04-15 12:18:24,108 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 25 states. [2022-04-15 12:18:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,108 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:18:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:18:24,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:24,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:24,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:24,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 12:18:24,109 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 12:18:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:24,110 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 12:18:24,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-15 12:18:24,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 12:18:24,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:18:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:18:24,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:24,134 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:24,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:24,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2022-04-15 12:18:24,338 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 25 times [2022-04-15 12:18:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:24,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996324275] [2022-04-15 12:18:24,375 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-15 12:18:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:24,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044786515] [2022-04-15 12:18:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:24,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:24,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 26 times [2022-04-15 12:18:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:24,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770512677] [2022-04-15 12:18:24,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:24,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {3490#(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(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 12:18:24,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 12:18:24,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 12:18:24,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:24,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {3490#(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(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 12:18:24,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 12:18:24,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 12:18:24,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-15 12:18:24,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#true} ~x~0 := 268435441; {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:24,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:24,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:24,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:24,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:24,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:24,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:24,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:24,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:24,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:24,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:24,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:24,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:24,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3489#(and (<= 268435415 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:18:24,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {3489#(and (<= 268435415 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {3472#false} is VALID [2022-04-15 12:18:24,644 INFO L272 TraceCheckUtils]: 20: Hoare triple {3472#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3472#false} is VALID [2022-04-15 12:18:24,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-15 12:18:24,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-15 12:18:24,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-15 12:18:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:24,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770512677] [2022-04-15 12:18:24,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770512677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496686507] [2022-04-15 12:18:24,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:24,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:24,645 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:24,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:18:24,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:24,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:24,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:18:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:24,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:24,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2022-04-15 12:18:24,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#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(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 12:18:24,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 12:18:24,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 12:18:24,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-15 12:18:24,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#true} ~x~0 := 268435441; {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:24,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:24,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:24,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:24,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:24,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:24,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:24,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:24,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:24,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:24,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:24,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:24,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:24,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3548#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:24,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {3548#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !(~x~0 % 4294967296 > 1); {3472#false} is VALID [2022-04-15 12:18:24,979 INFO L272 TraceCheckUtils]: 20: Hoare triple {3472#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3472#false} is VALID [2022-04-15 12:18:24,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-15 12:18:24,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-15 12:18:24,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-15 12:18:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:24,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:25,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-15 12:18:25,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-15 12:18:25,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-15 12:18:25,481 INFO L272 TraceCheckUtils]: 20: Hoare triple {3472#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3472#false} is VALID [2022-04-15 12:18:25,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {3576#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3472#false} is VALID [2022-04-15 12:18:25,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {3580#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3576#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:25,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {3584#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3580#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:25,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {3588#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3584#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:25,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {3592#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3588#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:25,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {3596#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3592#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:25,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {3600#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3596#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:25,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {3604#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3600#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:18:25,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {3608#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3604#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:25,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {3612#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3608#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:18:25,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {3616#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3612#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:18:25,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {3620#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3616#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:25,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {3624#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3620#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:25,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {3628#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3624#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:25,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#true} ~x~0 := 268435441; {3628#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:18:25,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-15 12:18:25,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 12:18:25,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 12:18:25,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#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(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 12:18:25,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2022-04-15 12:18:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:25,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496686507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:25,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:25,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 12:18:25,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:25,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996324275] [2022-04-15 12:18:25,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996324275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:25,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:25,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:18:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852475324] [2022-04-15 12:18:25,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 24 [2022-04-15 12:18:25,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:25,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:25,536 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-15 12:18:25,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:18:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:18:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:18:25,537 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:26,133 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:18:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:18:26,133 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 24 [2022-04-15 12:18:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 12:18:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 12:18:26,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-15 12:18:26,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:26,162 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:18:26,162 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:18:26,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:18:26,163 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:26,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:18:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:18:26,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:26,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-15 12:18:26,194 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-15 12:18:26,194 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-15 12:18:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:26,195 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:18:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:18:26,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:26,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:26,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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 26 states. [2022-04-15 12:18:26,196 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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 26 states. [2022-04-15 12:18:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:26,196 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:18:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:18:26,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:26,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:26,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:26,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-15 12:18:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 12:18:26,197 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 12:18:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:26,198 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 12:18:26,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:26,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 12:18:26,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:18:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:18:26,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:26,230 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:26,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:26,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2022-04-15 12:18:26,431 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 27 times [2022-04-15 12:18:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:26,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [199787613] [2022-04-15 12:18:26,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-15 12:18:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:26,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611176851] [2022-04-15 12:18:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:26,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:26,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 28 times [2022-04-15 12:18:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:26,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781182001] [2022-04-15 12:18:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:26,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {3863#(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(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 12:18:26,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 12:18:26,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 12:18:26,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:26,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {3863#(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(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 12:18:26,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 12:18:26,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 12:18:26,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-15 12:18:26,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} ~x~0 := 268435441; {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:26,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:26,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:26,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:26,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:26,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:26,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:26,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:26,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:26,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:26,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:26,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:26,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:26,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:26,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3862#(and (<= 268435413 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:18:26,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {3862#(and (<= 268435413 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {3844#false} is VALID [2022-04-15 12:18:26,738 INFO L272 TraceCheckUtils]: 21: Hoare triple {3844#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3844#false} is VALID [2022-04-15 12:18:26,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-15 12:18:26,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-15 12:18:26,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-15 12:18:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:26,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781182001] [2022-04-15 12:18:26,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781182001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:26,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790114037] [2022-04-15 12:18:26,739 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:26,740 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:26,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:18:26,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:26,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:26,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:18:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:26,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:27,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3843#true} is VALID [2022-04-15 12:18:27,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#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(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 12:18:27,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 12:18:27,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 12:18:27,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-15 12:18:27,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} ~x~0 := 268435441; {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:27,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:27,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:27,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:27,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:27,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:27,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:27,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:27,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:27,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:27,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:27,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:27,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:27,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:27,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3924#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:27,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {3924#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !(~x~0 % 4294967296 > 1); {3844#false} is VALID [2022-04-15 12:18:27,074 INFO L272 TraceCheckUtils]: 21: Hoare triple {3844#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3844#false} is VALID [2022-04-15 12:18:27,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-15 12:18:27,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-15 12:18:27,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-15 12:18:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:27,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:27,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-15 12:18:27,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-15 12:18:27,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-15 12:18:27,664 INFO L272 TraceCheckUtils]: 21: Hoare triple {3844#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3844#false} is VALID [2022-04-15 12:18:27,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {3952#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3844#false} is VALID [2022-04-15 12:18:27,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {3956#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3952#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:27,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {3960#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3956#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:27,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {3964#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3960#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:27,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {3968#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3964#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:27,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {3972#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3968#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:27,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {3976#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3972#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:27,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {3980#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3976#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:18:27,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {3984#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3980#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:27,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {3988#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3984#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:18:27,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {3992#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3988#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:18:27,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {3996#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3992#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:27,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {4000#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3996#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:27,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {4004#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4000#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:27,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {4008#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4004#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:18:27,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} ~x~0 := 268435441; {4008#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:18:27,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-15 12:18:27,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 12:18:27,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 12:18:27,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#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(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 12:18:27,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3843#true} is VALID [2022-04-15 12:18:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:27,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790114037] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:27,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:27,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 12:18:27,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:27,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [199787613] [2022-04-15 12:18:27,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [199787613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:27,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:27,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:18:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874442655] [2022-04-15 12:18:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 25 [2022-04-15 12:18:27,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:27,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:27,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:27,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:18:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:18:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:18:27,700 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,430 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:18:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:18:28,430 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 25 [2022-04-15 12:18:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 12:18:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 12:18:28,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-15 12:18:28,462 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-15 12:18:28,462 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:18:28,462 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:18:28,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 12:18:28,464 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:28,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:18:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:18:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:18:28,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:28,486 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-15 12:18:28,486 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-15 12:18:28,486 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-15 12:18:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,487 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:18:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:18:28,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,487 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-15 12:18:28,487 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-15 12:18:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,488 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:18:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:18:28,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:28,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:28,488 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-15 12:18:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 12:18:28,489 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 12:18:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:28,489 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 12:18:28,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 12:18:28,521 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-15 12:18:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:18:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:18:28,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:28,522 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:28,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:28,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:28,731 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 29 times [2022-04-15 12:18:28,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:28,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046318249] [2022-04-15 12:18:28,766 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-15 12:18:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:28,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105891854] [2022-04-15 12:18:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:28,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:28,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 30 times [2022-04-15 12:18:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:28,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435730408] [2022-04-15 12:18:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {4252#(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(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 12:18:29,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 12:18:29,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 12:18:29,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:29,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {4252#(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(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 12:18:29,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 12:18:29,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 12:18:29,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-15 12:18:29,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} ~x~0 := 268435441; {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:29,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:29,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:29,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:29,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:29,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:29,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:29,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:29,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:29,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:29,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:29,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:29,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:29,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:29,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:29,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4251#(and (<= (div main_~x~0 4294967296) 0) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:29,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#(and (<= (div main_~x~0 4294967296) 0) (<= 268435411 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {4232#false} is VALID [2022-04-15 12:18:29,062 INFO L272 TraceCheckUtils]: 22: Hoare triple {4232#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4232#false} is VALID [2022-04-15 12:18:29,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {4232#false} ~cond := #in~cond; {4232#false} is VALID [2022-04-15 12:18:29,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {4232#false} assume 0 == ~cond; {4232#false} is VALID [2022-04-15 12:18:29,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-15 12:18:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435730408] [2022-04-15 12:18:29,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435730408] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993393832] [2022-04-15 12:18:29,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:29,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:29,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:29,064 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:29,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:18:29,272 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 12:18:29,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:29,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:18:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:29,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-15 12:18:29,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#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(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 12:18:29,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 12:18:29,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 12:18:29,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-15 12:18:29,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} ~x~0 := 268435441; {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:29,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:29,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:29,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:29,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:29,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:29,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:29,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:29,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:29,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:29,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:29,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:29,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:29,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:29,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:29,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4316#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:29,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {4316#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {4232#false} is VALID [2022-04-15 12:18:29,476 INFO L272 TraceCheckUtils]: 22: Hoare triple {4232#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4232#false} is VALID [2022-04-15 12:18:29,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {4232#false} ~cond := #in~cond; {4232#false} is VALID [2022-04-15 12:18:29,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {4232#false} assume 0 == ~cond; {4232#false} is VALID [2022-04-15 12:18:29,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-15 12:18:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:29,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:30,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-15 12:18:30,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {4335#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4232#false} is VALID [2022-04-15 12:18:30,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {4339#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4335#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:30,429 INFO L272 TraceCheckUtils]: 22: Hoare triple {4343#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4339#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:30,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {4347#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {4343#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:30,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {4351#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4347#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {4355#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4351#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {4359#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4355#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {4363#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4359#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {4367#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4363#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {4371#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4367#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {4375#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4371#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {4379#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4375#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {4383#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4379#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {4387#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4383#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {4391#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4387#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {4395#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4391#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {4399#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4395#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {4403#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4399#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {4407#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4403#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} ~x~0 := 268435441; {4407#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:30,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-15 12:18:30,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 12:18:30,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 12:18:30,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#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(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 12:18:30,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-15 12:18:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:30,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993393832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:30,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:30,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 39 [2022-04-15 12:18:30,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:30,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046318249] [2022-04-15 12:18:30,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046318249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:30,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:30,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:18:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257186326] [2022-04-15 12:18:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:30,458 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-15 12:18:30,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:30,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-15 12:18:30,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:30,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:18:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:18:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:18:30,480 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-15 12:18:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,411 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:18:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:18:31,411 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-15 12:18:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-15 12:18:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 12:18:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-15 12:18:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 12:18:31,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-15 12:18:31,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:31,440 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:18:31,441 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:18:31,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=729, Invalid=2241, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:18:31,442 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:31,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:18:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 12:18:31,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:31,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,468 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,468 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,468 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:18:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:18:31,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:31,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:31,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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 28 states. [2022-04-15 12:18:31,469 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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 28 states. [2022-04-15 12:18:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,470 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:18:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:18:31,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:31,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:31,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:31,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 12:18:31,471 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 12:18:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:31,471 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 12:18:31,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-15 12:18:31,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 12:18:31,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:18:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:18:31,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:31,497 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:31,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:31,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:31,698 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 31 times [2022-04-15 12:18:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:31,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714601917] [2022-04-15 12:18:31,737 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-15 12:18:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:31,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035266330] [2022-04-15 12:18:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:31,744 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:31,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 32 times [2022-04-15 12:18:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538792691] [2022-04-15 12:18:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {4660#(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(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 12:18:32,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 12:18:32,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 12:18:32,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:32,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#(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(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 12:18:32,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 12:18:32,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 12:18:32,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-15 12:18:32,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {4638#true} ~x~0 := 268435441; {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:32,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:32,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:32,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:32,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:32,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:32,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:32,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:32,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:32,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:32,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:32,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:32,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:32,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:32,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:32,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:32,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4659#(and (<= (div main_~x~0 4294967296) 0) (<= 268435409 main_~x~0))} is VALID [2022-04-15 12:18:32,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {4659#(and (<= (div main_~x~0 4294967296) 0) (<= 268435409 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {4639#false} is VALID [2022-04-15 12:18:32,073 INFO L272 TraceCheckUtils]: 23: Hoare triple {4639#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4639#false} is VALID [2022-04-15 12:18:32,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {4639#false} ~cond := #in~cond; {4639#false} is VALID [2022-04-15 12:18:32,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {4639#false} assume 0 == ~cond; {4639#false} is VALID [2022-04-15 12:18:32,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-15 12:18:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:32,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:32,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538792691] [2022-04-15 12:18:32,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538792691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:32,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038311364] [2022-04-15 12:18:32,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:32,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:32,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:32,075 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:32,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:18:32,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:32,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:32,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:18:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:32,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4638#true} is VALID [2022-04-15 12:18:32,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#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(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 12:18:32,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 12:18:32,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 12:18:32,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-15 12:18:32,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {4638#true} ~x~0 := 268435441; {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:32,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:32,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:32,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:32,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:32,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:32,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:32,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:32,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:32,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:32,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:32,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:32,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:32,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:32,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:32,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:32,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4727#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:32,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {4727#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !(~x~0 % 4294967296 > 1); {4639#false} is VALID [2022-04-15 12:18:32,351 INFO L272 TraceCheckUtils]: 23: Hoare triple {4639#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4639#false} is VALID [2022-04-15 12:18:32,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {4639#false} ~cond := #in~cond; {4639#false} is VALID [2022-04-15 12:18:32,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {4639#false} assume 0 == ~cond; {4639#false} is VALID [2022-04-15 12:18:32,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-15 12:18:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:32,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:33,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-15 12:18:33,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {4746#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4639#false} is VALID [2022-04-15 12:18:33,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {4750#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4746#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:33,645 INFO L272 TraceCheckUtils]: 23: Hoare triple {4754#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4750#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:33,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {4758#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {4754#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:33,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {4762#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4758#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4762#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {4770#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4766#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {4774#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4770#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {4778#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4774#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {4782#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4778#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {4786#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4782#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4786#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {4794#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4790#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {4798#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4794#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {4802#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4798#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {4806#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4802#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {4810#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4806#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {4814#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4810#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4814#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {4822#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4818#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {4638#true} ~x~0 := 268435441; {4822#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:33,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-15 12:18:33,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 12:18:33,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 12:18:33,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#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(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 12:18:33,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4638#true} is VALID [2022-04-15 12:18:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:33,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038311364] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:33,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:33,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 22] total 41 [2022-04-15 12:18:33,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:33,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714601917] [2022-04-15 12:18:33,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714601917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:33,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:33,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:18:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107431133] [2022-04-15 12:18:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-15 12:18:33,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:33,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,713 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-15 12:18:33,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:18:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:18:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:18:33,714 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:34,831 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:18:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:18:34,831 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-15 12:18:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 12:18:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 12:18:34,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-15 12:18:34,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:34,862 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:18:34,862 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:18:34,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=808, Invalid=2498, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:18:34,863 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:34,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:18:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:18:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:18:34,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:34,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,888 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,888 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:34,889 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:18:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:18:34,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:34,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:34,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-15 12:18:34,889 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-15 12:18:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:34,890 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:18:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:18:34,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:34,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:34,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:34,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 12:18:34,891 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 12:18:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:34,891 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 12:18:34,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 12:18:34,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:18:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:18:34,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:34,922 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:34,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 12:18:35,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33 [2022-04-15 12:18:35,123 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 33 times [2022-04-15 12:18:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:35,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909329133] [2022-04-15 12:18:35,158 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-15 12:18:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:35,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362035089] [2022-04-15 12:18:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:35,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:35,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 34 times [2022-04-15 12:18:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:35,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713646169] [2022-04-15 12:18:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:35,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:35,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:35,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {5084#(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(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 12:18:35,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 12:18:35,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 12:18:35,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:35,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {5084#(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(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 12:18:35,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 12:18:35,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 12:18:35,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-15 12:18:35,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {5061#true} ~x~0 := 268435441; {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:35,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:35,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:35,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:35,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:35,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:35,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:35,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:35,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:35,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:35,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:35,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:35,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:35,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:35,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:35,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:35,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:35,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5083#(and (<= (div main_~x~0 4294967296) 0) (<= 268435407 main_~x~0))} is VALID [2022-04-15 12:18:35,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {5083#(and (<= (div main_~x~0 4294967296) 0) (<= 268435407 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5062#false} is VALID [2022-04-15 12:18:35,574 INFO L272 TraceCheckUtils]: 24: Hoare triple {5062#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5062#false} is VALID [2022-04-15 12:18:35,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-15 12:18:35,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-15 12:18:35,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-15 12:18:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713646169] [2022-04-15 12:18:35,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713646169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543327825] [2022-04-15 12:18:35,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:35,576 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:35,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:18:35,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:35,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:35,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 12:18:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:35,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:35,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5061#true} is VALID [2022-04-15 12:18:35,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {5061#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(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 12:18:35,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 12:18:35,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 12:18:35,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-15 12:18:35,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {5061#true} ~x~0 := 268435441; {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:35,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:35,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:35,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:35,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:35,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:35,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:35,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:35,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:35,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:35,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:35,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:35,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:35,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:35,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:35,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:35,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:35,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5154#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:35,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {5154#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !(~x~0 % 4294967296 > 1); {5062#false} is VALID [2022-04-15 12:18:35,937 INFO L272 TraceCheckUtils]: 24: Hoare triple {5062#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5062#false} is VALID [2022-04-15 12:18:35,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-15 12:18:35,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-15 12:18:35,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-15 12:18:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:35,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:36,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-15 12:18:36,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-15 12:18:36,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-15 12:18:36,890 INFO L272 TraceCheckUtils]: 24: Hoare triple {5062#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5062#false} is VALID [2022-04-15 12:18:36,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {5182#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {5062#false} is VALID [2022-04-15 12:18:36,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {5186#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5182#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:36,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {5190#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5186#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:36,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {5194#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5190#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:36,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {5198#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5194#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:36,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {5202#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5198#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:36,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {5206#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5202#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:36,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {5210#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5206#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:18:36,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {5214#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5210#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:36,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {5218#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5214#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:18:36,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {5222#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5218#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:18:36,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {5226#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5222#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:36,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {5230#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5226#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:36,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {5234#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5230#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:36,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {5238#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5234#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:18:36,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {5242#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5238#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:18:36,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {5246#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5242#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:18:36,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {5250#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5246#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:18:36,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {5061#true} ~x~0 := 268435441; {5250#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:18:36,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-15 12:18:36,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 12:18:36,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 12:18:36,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {5061#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(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 12:18:36,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5061#true} is VALID [2022-04-15 12:18:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:36,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543327825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:36,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:36,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 12:18:36,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:36,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909329133] [2022-04-15 12:18:36,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909329133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:36,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:36,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:18:36,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543404823] [2022-04-15 12:18:36,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:36,916 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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 28 [2022-04-15 12:18:36,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:36,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:36,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:18:36,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:18:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:18:36,939 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:38,278 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:18:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:18:38,279 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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 28 [2022-04-15 12:18:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 12:18:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 12:18:38,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-15 12:18:38,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:38,321 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:18:38,321 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:18:38,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=867, Invalid=2439, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:18:38,323 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:38,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:18:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:18:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:18:38,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:38,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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-15 12:18:38,371 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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-15 12:18:38,371 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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-15 12:18:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:38,372 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:18:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:18:38,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:38,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:38,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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 30 states. [2022-04-15 12:18:38,373 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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 30 states. [2022-04-15 12:18:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:38,373 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:18:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:18:38,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:38,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:38,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:38,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 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-15 12:18:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 12:18:38,374 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 12:18:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:38,375 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 12:18:38,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:38,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 12:18:38,419 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-15 12:18:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:18:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:18:38,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:38,419 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:38,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:38,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:38,620 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 35 times [2022-04-15 12:18:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:38,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437394332] [2022-04-15 12:18:38,654 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-15 12:18:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:38,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632304662] [2022-04-15 12:18:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:38,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:38,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 36 times [2022-04-15 12:18:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557514491] [2022-04-15 12:18:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:38,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {5521#(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(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 12:18:39,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 12:18:39,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 12:18:39,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:39,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {5521#(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(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 12:18:39,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 12:18:39,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 12:18:39,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-15 12:18:39,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {5497#true} ~x~0 := 268435441; {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:39,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:39,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:39,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:39,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:39,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:39,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:39,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:39,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:39,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:39,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:39,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:39,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:39,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:39,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:39,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:39,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:39,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:39,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5520#(and (<= (div main_~x~0 4294967296) 0) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:39,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {5520#(and (<= (div main_~x~0 4294967296) 0) (<= 268435405 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5498#false} is VALID [2022-04-15 12:18:39,022 INFO L272 TraceCheckUtils]: 25: Hoare triple {5498#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5498#false} is VALID [2022-04-15 12:18:39,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-15 12:18:39,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-15 12:18:39,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-15 12:18:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:39,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557514491] [2022-04-15 12:18:39,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557514491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:39,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623652164] [2022-04-15 12:18:39,023 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:39,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:39,025 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:39,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:18:39,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 12:18:39,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:39,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:18:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:39,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:39,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-15 12:18:39,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#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(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 12:18:39,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 12:18:39,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 12:18:39,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-15 12:18:39,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {5497#true} ~x~0 := 268435441; {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:39,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:39,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:39,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:39,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:39,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:39,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:39,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:39,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:39,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:39,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:39,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:39,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:39,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:39,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:39,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:39,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:39,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:39,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5594#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:39,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5498#false} is VALID [2022-04-15 12:18:39,627 INFO L272 TraceCheckUtils]: 25: Hoare triple {5498#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5498#false} is VALID [2022-04-15 12:18:39,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-15 12:18:39,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-15 12:18:39,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-15 12:18:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:39,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:41,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-15 12:18:41,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {5613#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5498#false} is VALID [2022-04-15 12:18:41,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {5617#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5613#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:41,136 INFO L272 TraceCheckUtils]: 25: Hoare triple {5621#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5617#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:41,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {5625#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {5621#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:41,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {5629#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5625#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {5633#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5629#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5633#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {5641#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5637#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {5645#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5641#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {5649#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5645#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {5653#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5649#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {5657#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5653#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5657#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5661#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {5669#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5665#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {5673#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5669#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {5677#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5673#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {5681#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5677#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {5685#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5681#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {5689#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5685#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {5693#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5689#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {5697#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5693#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {5497#true} ~x~0 := 268435441; {5697#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:41,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-15 12:18:41,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 12:18:41,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 12:18:41,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#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(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 12:18:41,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-15 12:18:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:41,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623652164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:41,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:41,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 45 [2022-04-15 12:18:41,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:41,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437394332] [2022-04-15 12:18:41,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437394332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:41,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:41,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:18:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111102773] [2022-04-15 12:18:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:41,177 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-15 12:18:41,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:41,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:41,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:41,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:18:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:18:41,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1475, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:18:41,199 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:42,652 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:18:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:18:42,653 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-15 12:18:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 12:18:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 12:18:42,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-15 12:18:42,697 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-15 12:18:42,698 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:18:42,698 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:18:42,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:18:42,699 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:42,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:18:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:18:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:18:42,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:42,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,730 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,731 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:42,731 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:18:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:18:42,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:42,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:42,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 31 states. [2022-04-15 12:18:42,732 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 31 states. [2022-04-15 12:18:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:42,732 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:18:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:18:42,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:42,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:42,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:42,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 12:18:42,733 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 12:18:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:42,733 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 12:18:42,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:42,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 12:18:42,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:18:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:18:42,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:42,768 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:42,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:42,969 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 12:18:42,969 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 37 times [2022-04-15 12:18:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:42,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255375259] [2022-04-15 12:18:43,004 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-15 12:18:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:43,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100711870] [2022-04-15 12:18:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:43,011 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:43,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 38 times [2022-04-15 12:18:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:43,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892304488] [2022-04-15 12:18:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:43,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {5977#(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(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 12:18:43,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 12:18:43,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 12:18:43,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:43,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#(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(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 12:18:43,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 12:18:43,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 12:18:43,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-15 12:18:43,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {5952#true} ~x~0 := 268435441; {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:43,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:43,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:43,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:43,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:43,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:43,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:43,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:43,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:43,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:43,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:43,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:43,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:43,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:43,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:43,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:43,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:43,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:43,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:43,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5976#(and (<= (div main_~x~0 4294967296) 0) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:18:43,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {5976#(and (<= (div main_~x~0 4294967296) 0) (<= 268435403 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5953#false} is VALID [2022-04-15 12:18:43,422 INFO L272 TraceCheckUtils]: 26: Hoare triple {5953#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5953#false} is VALID [2022-04-15 12:18:43,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2022-04-15 12:18:43,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {5953#false} assume 0 == ~cond; {5953#false} is VALID [2022-04-15 12:18:43,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-15 12:18:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892304488] [2022-04-15 12:18:43,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892304488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567200376] [2022-04-15 12:18:43,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:43,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:43,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:43,425 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:43,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:18:43,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:43,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:43,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:18:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:43,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:43,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2022-04-15 12:18:43,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {5952#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(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 12:18:43,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 12:18:43,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 12:18:43,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-15 12:18:43,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {5952#true} ~x~0 := 268435441; {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:43,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:43,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:43,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:43,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:43,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:43,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:43,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:43,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:43,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:43,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:43,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:43,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:43,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:43,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:43,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:43,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:43,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:43,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:43,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6053#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:18:43,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {6053#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5953#false} is VALID [2022-04-15 12:18:43,749 INFO L272 TraceCheckUtils]: 26: Hoare triple {5953#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5953#false} is VALID [2022-04-15 12:18:43,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2022-04-15 12:18:43,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {5953#false} assume 0 == ~cond; {5953#false} is VALID [2022-04-15 12:18:43,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-15 12:18:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:43,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:45,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-15 12:18:45,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {6072#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5953#false} is VALID [2022-04-15 12:18:45,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {6076#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6072#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:45,650 INFO L272 TraceCheckUtils]: 26: Hoare triple {6080#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6076#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:45,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {6084#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {6080#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:45,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {6088#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6084#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {6092#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6088#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {6096#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6092#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {6100#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6096#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {6104#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6100#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {6108#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6104#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {6112#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6108#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {6116#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6112#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {6120#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6116#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {6124#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6120#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {6128#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6124#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6128#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {6136#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6132#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {6140#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6136#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {6144#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6140#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {6148#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6144#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {6152#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6148#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {6156#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6152#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {6160#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6156#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {5952#true} ~x~0 := 268435441; {6160#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:45,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-15 12:18:45,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 12:18:45,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 12:18:45,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {5952#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(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 12:18:45,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2022-04-15 12:18:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:45,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567200376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:45,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:45,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 47 [2022-04-15 12:18:45,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:45,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255375259] [2022-04-15 12:18:45,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255375259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:45,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:45,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:18:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777835315] [2022-04-15 12:18:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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 30 [2022-04-15 12:18:45,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:45,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:45,745 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-15 12:18:45,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:18:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:18:45,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1611, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:18:45,747 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:47,603 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:18:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:18:47,603 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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 30 [2022-04-15 12:18:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 12:18:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 12:18:47,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-15 12:18:47,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:47,644 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:18:47,644 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:18:47,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1069, Invalid=3353, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:18:47,646 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:47,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:18:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:18:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 12:18:47,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:47,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,681 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,681 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:47,681 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:18:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:18:47,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:47,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:47,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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 32 states. [2022-04-15 12:18:47,682 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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 32 states. [2022-04-15 12:18:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:47,682 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:18:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:18:47,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:47,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:47,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:47,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 12:18:47,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 12:18:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:47,683 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 12:18:47,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:47,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 12:18:47,721 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-15 12:18:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:18:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:18:47,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:47,722 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:47,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:47,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 12:18:47,922 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 39 times [2022-04-15 12:18:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:47,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513783199] [2022-04-15 12:18:47,962 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-15 12:18:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:47,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767470772] [2022-04-15 12:18:47,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:47,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:47,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:47,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 40 times [2022-04-15 12:18:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:47,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001864532] [2022-04-15 12:18:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:48,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {6449#(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(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 12:18:48,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 12:18:48,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 12:18:48,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:48,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {6449#(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(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 12:18:48,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 12:18:48,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 12:18:48,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-15 12:18:48,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} ~x~0 := 268435441; {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:48,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:48,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:48,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:48,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:48,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:48,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:48,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:48,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:48,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:48,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:48,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:48,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:48,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:48,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:48,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:48,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:48,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:48,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:48,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:18:48,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6448#(and (<= (div main_~x~0 4294967296) 0) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:18:48,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {6448#(and (<= (div main_~x~0 4294967296) 0) (<= 268435401 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {6424#false} is VALID [2022-04-15 12:18:48,400 INFO L272 TraceCheckUtils]: 27: Hoare triple {6424#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6424#false} is VALID [2022-04-15 12:18:48,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-15 12:18:48,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-15 12:18:48,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-15 12:18:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:48,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001864532] [2022-04-15 12:18:48,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001864532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886163057] [2022-04-15 12:18:48,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:48,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:48,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:48,402 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:48,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:18:48,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:48,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:48,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 12:18:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:48,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:48,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-15 12:18:48,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#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(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 12:18:48,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 12:18:48,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 12:18:48,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-15 12:18:48,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} ~x~0 := 268435441; {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:48,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:48,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:48,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:48,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:48,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:48,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:48,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:48,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:48,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:48,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:48,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:48,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:48,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:48,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:48,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:48,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:48,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:48,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:48,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:18:48,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6528#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:18:48,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {6528#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {6424#false} is VALID [2022-04-15 12:18:48,824 INFO L272 TraceCheckUtils]: 27: Hoare triple {6424#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6424#false} is VALID [2022-04-15 12:18:48,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-15 12:18:48,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-15 12:18:48,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-15 12:18:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:48,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:50,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-15 12:18:50,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-15 12:18:50,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-15 12:18:50,362 INFO L272 TraceCheckUtils]: 27: Hoare triple {6424#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6424#false} is VALID [2022-04-15 12:18:50,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {6556#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {6424#false} is VALID [2022-04-15 12:18:50,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {6560#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6556#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:18:50,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {6564#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6560#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:18:50,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {6568#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6564#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {6572#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6568#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {6576#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6572#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {6580#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6576#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:18:50,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {6584#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6580#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:18:50,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {6588#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6584#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {6592#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6588#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:18:50,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {6596#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6592#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:18:50,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {6600#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6596#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {6604#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6600#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {6608#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6604#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {6612#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6608#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:18:50,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {6616#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6612#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:18:50,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {6620#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6616#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:18:50,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6620#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:18:50,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {6628#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6624#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:18:50,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {6632#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6628#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:18:50,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {6636#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6632#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:18:50,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} ~x~0 := 268435441; {6636#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:18:50,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-15 12:18:50,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 12:18:50,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 12:18:50,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#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(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 12:18:50,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-15 12:18:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:50,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886163057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:50,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:50,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 12:18:50,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:50,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513783199] [2022-04-15 12:18:50,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513783199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:50,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:50,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:18:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544987218] [2022-04-15 12:18:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:50,420 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 31 [2022-04-15 12:18:50,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:50,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:50,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:50,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:18:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:18:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:18:50,454 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,008 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:18:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:18:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 31 [2022-04-15 12:18:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 12:18:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 12:18:53,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-15 12:18:53,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:53,070 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:18:53,070 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:18:53,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:18:53,072 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:53,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:18:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:18:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:18:53,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:53,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,120 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,120 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,121 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:18:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:18:53,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:53,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:53,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 33 states. [2022-04-15 12:18:53,122 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 33 states. [2022-04-15 12:18:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,122 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:18:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:18:53,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:53,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:53,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:53,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 12:18:53,124 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 12:18:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:53,124 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 12:18:53,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 12:18:53,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:18:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:18:53,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:53,210 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:53,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:53,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41 [2022-04-15 12:18:53,411 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 41 times [2022-04-15 12:18:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633040482] [2022-04-15 12:18:53,451 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-15 12:18:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:53,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204893633] [2022-04-15 12:18:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:53,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:53,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 42 times [2022-04-15 12:18:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:53,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607477933] [2022-04-15 12:18:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:53,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:54,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:54,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {6934#(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(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 12:18:54,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 12:18:54,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 12:18:54,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:54,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {6934#(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(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 12:18:54,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 12:18:54,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 12:18:54,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-15 12:18:54,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {6907#true} ~x~0 := 268435441; {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:54,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:54,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:54,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:54,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:54,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:54,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:54,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:54,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:54,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:54,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:54,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:54,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:54,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:54,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:54,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:54,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:54,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:54,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:54,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:18:54,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:18:54,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6933#(and (<= (div main_~x~0 4294967296) 0) (<= 268435399 main_~x~0))} is VALID [2022-04-15 12:18:54,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {6933#(and (<= (div main_~x~0 4294967296) 0) (<= 268435399 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {6908#false} is VALID [2022-04-15 12:18:54,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {6908#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6908#false} is VALID [2022-04-15 12:18:54,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {6908#false} ~cond := #in~cond; {6908#false} is VALID [2022-04-15 12:18:54,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#false} assume 0 == ~cond; {6908#false} is VALID [2022-04-15 12:18:54,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-15 12:18:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:54,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607477933] [2022-04-15 12:18:54,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607477933] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:54,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415292882] [2022-04-15 12:18:54,268 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:54,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:54,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:54,277 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:54,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:18:54,583 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 12:18:54,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:54,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:18:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:54,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:54,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6907#true} is VALID [2022-04-15 12:18:54,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {6907#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(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 12:18:54,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 12:18:54,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 12:18:54,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-15 12:18:54,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {6907#true} ~x~0 := 268435441; {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:18:54,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:18:54,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:18:54,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:18:54,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:18:54,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:18:54,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:18:55,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:18:55,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:18:55,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:18:55,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:18:55,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:18:55,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:18:55,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:18:55,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:18:55,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:18:55,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:18:55,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:18:55,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:18:55,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:18:55,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:18:55,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7016#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:18:55,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {7016#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !(~x~0 % 4294967296 > 1); {6908#false} is VALID [2022-04-15 12:18:55,026 INFO L272 TraceCheckUtils]: 28: Hoare triple {6908#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6908#false} is VALID [2022-04-15 12:18:55,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {6908#false} ~cond := #in~cond; {6908#false} is VALID [2022-04-15 12:18:55,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#false} assume 0 == ~cond; {6908#false} is VALID [2022-04-15 12:18:55,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-15 12:18:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:55,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:57,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-15 12:18:57,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {7035#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6908#false} is VALID [2022-04-15 12:18:57,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {7039#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7035#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:57,721 INFO L272 TraceCheckUtils]: 28: Hoare triple {7043#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7039#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:57,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {7047#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {7043#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:57,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {7051#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7047#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7051#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {7059#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7055#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {7063#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7059#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {7067#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7063#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {7071#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7067#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {7075#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7071#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {7079#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7075#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {7083#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7079#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {7087#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7083#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {7091#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7087#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {7095#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7091#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {7099#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7095#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {7103#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7099#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {7107#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7103#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {7111#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7107#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {7115#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7111#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {7119#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7115#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {7123#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7119#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {7127#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7123#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {7131#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7127#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {6907#true} ~x~0 := 268435441; {7131#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:57,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-15 12:18:57,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 12:18:57,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 12:18:57,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {6907#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(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 12:18:57,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6907#true} is VALID [2022-04-15 12:18:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:57,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415292882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:57,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:57,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 27] total 51 [2022-04-15 12:18:57,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:57,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633040482] [2022-04-15 12:18:57,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633040482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:57,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:57,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:18:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168416886] [2022-04-15 12:18:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:57,787 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-15 12:18:57,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:57,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:57,812 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-15 12:18:57,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:18:57,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:57,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:18:57,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1901, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:18:57,813 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:59,887 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:18:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:18:59,887 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-15 12:18:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 12:18:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 12:18:59,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-15 12:18:59,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:59,924 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:18:59,924 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:18:59,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1263, Invalid=3993, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:18:59,926 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:59,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:18:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:18:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 12:18:59,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:59,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,962 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,962 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:59,963 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:18:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:18:59,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:59,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:59,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 34 states. [2022-04-15 12:18:59,963 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 34 states. [2022-04-15 12:18:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:59,963 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:18:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:18:59,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:59,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:59,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:59,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 12:18:59,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 12:18:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:59,965 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 12:18:59,965 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 12:19:00,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:19:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:19:00,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:00,009 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:00,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:00,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-15 12:19:00,209 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:00,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 43 times [2022-04-15 12:19:00,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:00,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270444848] [2022-04-15 12:19:00,243 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-15 12:19:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:00,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400901670] [2022-04-15 12:19:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:00,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:00,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 44 times [2022-04-15 12:19:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:00,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899901061] [2022-04-15 12:19:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:00,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:00,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {7438#(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(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 12:19:00,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 12:19:00,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 12:19:00,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:00,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {7438#(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(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 12:19:00,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 12:19:00,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 12:19:00,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-15 12:19:00,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {7410#true} ~x~0 := 268435441; {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:00,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:00,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:00,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:00,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:00,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:00,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:00,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:00,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:00,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:00,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:00,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:00,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:00,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:00,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:00,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:00,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:00,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:00,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:00,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:00,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:00,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:00,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7437#(and (<= (div main_~x~0 4294967296) 0) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:00,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {7437#(and (<= (div main_~x~0 4294967296) 0) (<= 268435397 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {7411#false} is VALID [2022-04-15 12:19:00,701 INFO L272 TraceCheckUtils]: 29: Hoare triple {7411#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7411#false} is VALID [2022-04-15 12:19:00,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2022-04-15 12:19:00,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2022-04-15 12:19:00,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-15 12:19:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:00,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899901061] [2022-04-15 12:19:00,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899901061] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:00,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331628867] [2022-04-15 12:19:00,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:00,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:00,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:00,703 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:00,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:19:00,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:00,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:00,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 12:19:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:00,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:00,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2022-04-15 12:19:00,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#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(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 12:19:00,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 12:19:00,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 12:19:00,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-15 12:19:00,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {7410#true} ~x~0 := 268435441; {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:00,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:00,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:00,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:00,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:00,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:00,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:01,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:01,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:01,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:01,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:01,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:01,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:01,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:01,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:01,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:01,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:01,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:01,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:01,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:01,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:01,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:01,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7523#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:01,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {7523#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {7411#false} is VALID [2022-04-15 12:19:01,024 INFO L272 TraceCheckUtils]: 29: Hoare triple {7411#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7411#false} is VALID [2022-04-15 12:19:01,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2022-04-15 12:19:01,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2022-04-15 12:19:01,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-15 12:19:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:01,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:03,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-15 12:19:03,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {7542#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7411#false} is VALID [2022-04-15 12:19:03,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {7546#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7542#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:19:03,730 INFO L272 TraceCheckUtils]: 29: Hoare triple {7550#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7546#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:03,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {7554#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {7550#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:03,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {7558#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7554#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {7562#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7558#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {7566#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7562#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {7570#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7566#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {7574#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7570#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7574#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {7582#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7578#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {7586#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7582#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {7590#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7586#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {7594#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7590#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {7598#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7594#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {7602#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7598#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {7606#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7602#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {7610#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7606#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {7614#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7610#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {7618#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7614#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {7622#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7618#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {7626#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7622#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {7630#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7626#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {7634#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7630#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {7638#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7634#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {7642#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7638#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {7410#true} ~x~0 := 268435441; {7642#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:03,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-15 12:19:03,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 12:19:03,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 12:19:03,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#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(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 12:19:03,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2022-04-15 12:19:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:03,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331628867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:03,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:03,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 28] total 53 [2022-04-15 12:19:03,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [270444848] [2022-04-15 12:19:03,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [270444848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:03,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:03,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:19:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323549853] [2022-04-15 12:19:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:03,821 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-15 12:19:03,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:03,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:03,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:03,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:19:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:03,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:19:03,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=2055, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 12:19:03,866 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:07,125 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:19:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:19:07,125 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-15 12:19:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 12:19:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 12:19:07,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-15 12:19:07,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:07,186 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:19:07,186 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:19:07,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1366, Invalid=4334, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 12:19:07,188 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:07,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:19:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:19:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:19:07,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:07,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,227 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,227 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:07,227 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:19:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:19:07,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:07,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:07,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 35 states. [2022-04-15 12:19:07,228 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 35 states. [2022-04-15 12:19:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:07,230 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:19:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:19:07,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:07,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:07,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:07,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 12:19:07,231 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 12:19:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:07,232 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 12:19:07,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:07,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 12:19:07,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:19:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:19:07,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:07,300 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:07,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:07,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:07,500 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 45 times [2022-04-15 12:19:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:07,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272827463] [2022-04-15 12:19:07,542 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:07,543 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-15 12:19:07,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:07,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198537357] [2022-04-15 12:19:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:07,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:07,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:07,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 46 times [2022-04-15 12:19:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34244948] [2022-04-15 12:19:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:08,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {7958#(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(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 12:19:08,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 12:19:08,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 12:19:08,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:08,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#(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(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 12:19:08,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 12:19:08,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 12:19:08,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-15 12:19:08,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {7929#true} ~x~0 := 268435441; {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:08,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:08,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:08,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:08,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:08,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:08,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:08,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:08,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:08,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:08,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:08,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:08,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:08,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:08,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:08,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:08,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:08,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:08,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:08,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:08,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:08,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:08,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:08,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7957#(and (<= (div main_~x~0 4294967296) 0) (<= 268435395 main_~x~0))} is VALID [2022-04-15 12:19:08,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {7957#(and (<= (div main_~x~0 4294967296) 0) (<= 268435395 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {7930#false} is VALID [2022-04-15 12:19:08,543 INFO L272 TraceCheckUtils]: 30: Hoare triple {7930#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7930#false} is VALID [2022-04-15 12:19:08,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-15 12:19:08,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-15 12:19:08,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-15 12:19:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:08,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34244948] [2022-04-15 12:19:08,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34244948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:08,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361396033] [2022-04-15 12:19:08,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:08,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:08,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:08,546 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:08,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:19:08,627 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:08,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:08,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 12:19:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:08,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:09,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7929#true} is VALID [2022-04-15 12:19:09,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#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(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 12:19:09,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 12:19:09,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 12:19:09,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-15 12:19:09,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {7929#true} ~x~0 := 268435441; {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:09,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:09,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:09,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:09,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:09,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:09,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:09,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:09,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:09,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:09,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:09,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:09,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:09,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:09,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:09,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:09,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:09,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:09,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:09,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:09,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:09,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:09,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:09,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8046#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:09,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {8046#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !(~x~0 % 4294967296 > 1); {7930#false} is VALID [2022-04-15 12:19:09,114 INFO L272 TraceCheckUtils]: 30: Hoare triple {7930#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7930#false} is VALID [2022-04-15 12:19:09,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-15 12:19:09,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-15 12:19:09,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-15 12:19:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:09,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:11,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-15 12:19:11,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-15 12:19:11,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-15 12:19:11,642 INFO L272 TraceCheckUtils]: 30: Hoare triple {7930#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7930#false} is VALID [2022-04-15 12:19:11,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {8074#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {7930#false} is VALID [2022-04-15 12:19:11,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {8078#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8074#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:19:11,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {8082#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8078#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:19:11,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {8086#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8082#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {8090#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8086#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {8094#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8090#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {8098#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8094#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:19:11,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {8102#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8098#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:19:11,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {8106#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8102#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {8110#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8106#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:19:11,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {8114#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8110#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:19:11,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {8118#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8114#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {8122#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8118#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {8126#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8122#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {8130#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8126#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:19:11,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {8134#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8130#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:19:11,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {8138#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8134#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:19:11,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {8142#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8138#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:19:11,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {8146#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8142#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:19:11,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {8150#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8146#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {8154#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8150#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:19:11,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {8158#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8154#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:19:11,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {8162#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8158#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {8166#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8162#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:19:11,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {7929#true} ~x~0 := 268435441; {8166#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:11,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-15 12:19:11,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 12:19:11,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 12:19:11,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#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(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 12:19:11,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7929#true} is VALID [2022-04-15 12:19:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:11,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361396033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:11,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:11,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 12:19:11,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:11,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272827463] [2022-04-15 12:19:11,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272827463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:11,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:11,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:19:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658675346] [2022-04-15 12:19:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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 34 [2022-04-15 12:19:11,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:11,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:11,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:11,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:19:11,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:11,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:19:11,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:19:11,729 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:14,679 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:19:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:19:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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 34 [2022-04-15 12:19:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 12:19:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 12:19:14,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-15 12:19:14,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:14,721 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:19:14,721 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:19:14,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 12:19:14,722 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:14,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:19:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:19:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 12:19:14,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:14,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,761 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,761 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:14,762 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:19:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:19:14,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:14,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:14,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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 36 states. [2022-04-15 12:19:14,763 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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 36 states. [2022-04-15 12:19:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:14,763 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:19:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:19:14,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:14,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:14,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:14,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 12:19:14,764 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 12:19:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:14,765 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 12:19:14,765 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:14,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 12:19:14,827 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-15 12:19:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:19:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:19:14,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:14,828 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:14,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:15,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:15,028 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 47 times [2022-04-15 12:19:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:15,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49826794] [2022-04-15 12:19:15,060 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-15 12:19:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:15,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3600757] [2022-04-15 12:19:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:15,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:15,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 48 times [2022-04-15 12:19:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:15,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259437926] [2022-04-15 12:19:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:15,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:15,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {8491#(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(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 12:19:15,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 12:19:15,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 12:19:15,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:15,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {8491#(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(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 12:19:15,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 12:19:15,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 12:19:15,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-15 12:19:15,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {8461#true} ~x~0 := 268435441; {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:15,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:15,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:15,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:15,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:15,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:15,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:15,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:15,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:15,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:15,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:15,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:15,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:15,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:15,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:15,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:15,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:15,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:15,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:15,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:15,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:15,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:15,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:15,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:15,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8490#(and (<= (div main_~x~0 4294967296) 0) (<= 268435393 main_~x~0))} is VALID [2022-04-15 12:19:15,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {8490#(and (<= (div main_~x~0 4294967296) 0) (<= 268435393 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {8462#false} is VALID [2022-04-15 12:19:15,639 INFO L272 TraceCheckUtils]: 31: Hoare triple {8462#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8462#false} is VALID [2022-04-15 12:19:15,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {8462#false} ~cond := #in~cond; {8462#false} is VALID [2022-04-15 12:19:15,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {8462#false} assume 0 == ~cond; {8462#false} is VALID [2022-04-15 12:19:15,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-15 12:19:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259437926] [2022-04-15 12:19:15,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259437926] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870903084] [2022-04-15 12:19:15,640 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:15,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:15,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:15,643 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:15,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:19:15,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 12:19:15,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:15,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 12:19:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:15,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:16,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8461#true} is VALID [2022-04-15 12:19:16,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {8461#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(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 12:19:16,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 12:19:16,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 12:19:16,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-15 12:19:16,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {8461#true} ~x~0 := 268435441; {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:16,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:16,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:16,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:16,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:16,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:16,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:16,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:16,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:16,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:16,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:16,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:16,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:16,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:16,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:16,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:16,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:16,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:16,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:16,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:16,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:16,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:16,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:16,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:16,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8582#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:19:16,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {8582#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !(~x~0 % 4294967296 > 1); {8462#false} is VALID [2022-04-15 12:19:16,313 INFO L272 TraceCheckUtils]: 31: Hoare triple {8462#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8462#false} is VALID [2022-04-15 12:19:16,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {8462#false} ~cond := #in~cond; {8462#false} is VALID [2022-04-15 12:19:16,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {8462#false} assume 0 == ~cond; {8462#false} is VALID [2022-04-15 12:19:16,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-15 12:19:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:16,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:19,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-15 12:19:19,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8462#false} is VALID [2022-04-15 12:19:19,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {8605#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8601#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:19:19,750 INFO L272 TraceCheckUtils]: 31: Hoare triple {8609#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8605#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:19,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {8613#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {8609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:19,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {8617#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8613#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {8621#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8617#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {8625#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8621#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {8629#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8625#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {8633#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8629#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {8637#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8633#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {8641#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8637#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {8645#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8641#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {8649#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8645#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {8653#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8649#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {8657#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8653#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {8661#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8657#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {8665#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8661#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {8669#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8665#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {8673#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8669#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {8677#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8673#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {8681#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8677#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {8685#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8681#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {8689#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8685#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {8693#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8689#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {8697#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8693#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {8701#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8697#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {8705#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8701#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {8709#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8705#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {8461#true} ~x~0 := 268435441; {8709#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:19,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-15 12:19:19,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 12:19:19,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 12:19:19,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {8461#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(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 12:19:19,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8461#true} is VALID [2022-04-15 12:19:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:19,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870903084] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:19,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:19,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 57 [2022-04-15 12:19:19,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:19,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49826794] [2022-04-15 12:19:19,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49826794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:19,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:19,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:19:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591050943] [2022-04-15 12:19:19,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-15 12:19:19,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:19,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:19,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:19,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:19:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:19:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:19:19,869 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:23,773 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:19:23,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:19:23,773 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-15 12:19:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 12:19:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 12:19:23,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-15 12:19:23,855 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-15 12:19:23,856 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:19:23,856 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:19:23,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1584, Invalid=5058, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:19:23,858 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:23,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 12:19:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:19:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:19:23,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:23,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,913 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,913 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:23,915 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:19:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:19:23,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:23,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:23,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 37 states. [2022-04-15 12:19:23,915 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 37 states. [2022-04-15 12:19:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:23,916 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:19:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:19:23,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:23,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:23,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:23,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 12:19:23,917 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 12:19:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:23,917 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 12:19:23,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:23,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 12:19:24,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:19:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:19:24,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:24,069 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:24,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:24,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2022-04-15 12:19:24,269 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 49 times [2022-04-15 12:19:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:24,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233323518] [2022-04-15 12:19:24,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-15 12:19:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:24,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268516178] [2022-04-15 12:19:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:24,328 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:24,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 50 times [2022-04-15 12:19:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:24,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316830722] [2022-04-15 12:19:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:25,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {9043#(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(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 12:19:25,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 12:19:25,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 12:19:25,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:25,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {9043#(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(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 12:19:25,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 12:19:25,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 12:19:25,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-15 12:19:25,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} ~x~0 := 268435441; {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:25,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:25,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:25,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:25,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:25,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:25,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:25,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:25,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:25,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:25,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:25,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:25,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:25,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:25,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:25,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:25,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:25,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:25,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:25,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:25,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:25,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:25,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:25,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:25,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:19:25,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9042#(and (<= (div main_~x~0 4294967296) 0) (<= 268435391 main_~x~0))} is VALID [2022-04-15 12:19:25,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {9042#(and (<= (div main_~x~0 4294967296) 0) (<= 268435391 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {9013#false} is VALID [2022-04-15 12:19:25,281 INFO L272 TraceCheckUtils]: 32: Hoare triple {9013#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9013#false} is VALID [2022-04-15 12:19:25,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-15 12:19:25,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-15 12:19:25,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-15 12:19:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:25,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:25,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316830722] [2022-04-15 12:19:25,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316830722] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:25,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061584479] [2022-04-15 12:19:25,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:25,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:25,283 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:25,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:19:25,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:25,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:25,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 12:19:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:25,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:25,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9012#true} is VALID [2022-04-15 12:19:25,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#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(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 12:19:25,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 12:19:25,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 12:19:25,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-15 12:19:25,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} ~x~0 := 268435441; {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:25,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:25,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:25,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:25,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:25,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:25,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:25,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:25,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:25,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:25,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:25,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:25,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:25,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:25,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:25,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:25,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:25,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:25,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:26,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:26,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:26,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:26,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:26,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:26,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:19:26,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9137#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:19:26,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {9137#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !(~x~0 % 4294967296 > 1); {9013#false} is VALID [2022-04-15 12:19:26,017 INFO L272 TraceCheckUtils]: 32: Hoare triple {9013#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9013#false} is VALID [2022-04-15 12:19:26,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-15 12:19:26,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-15 12:19:26,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-15 12:19:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:26,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:29,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-15 12:19:29,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-15 12:19:29,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-15 12:19:29,761 INFO L272 TraceCheckUtils]: 32: Hoare triple {9013#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9013#false} is VALID [2022-04-15 12:19:29,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {9165#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {9013#false} is VALID [2022-04-15 12:19:29,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {9169#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9165#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:19:29,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {9173#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9169#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:19:29,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {9177#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9173#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {9181#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9177#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {9185#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9181#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {9189#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9185#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:19:29,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {9193#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9189#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:19:29,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {9197#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9193#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {9201#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9197#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:19:29,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {9205#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9201#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:19:29,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {9209#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9205#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {9213#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9209#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {9217#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9213#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {9221#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9217#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:19:29,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {9225#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9221#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:19:29,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {9229#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9225#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:19:29,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {9233#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9229#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:19:29,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {9237#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9233#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:19:29,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {9241#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9237#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {9245#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9241#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:19:29,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {9249#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9245#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:19:29,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {9253#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9249#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {9257#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9253#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:19:29,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {9261#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9257#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {9265#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9261#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 12:19:29,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} ~x~0 := 268435441; {9265#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:29,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-15 12:19:29,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 12:19:29,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 12:19:29,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#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(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 12:19:29,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9012#true} is VALID [2022-04-15 12:19:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:29,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061584479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:29,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:29,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 12:19:29,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:29,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233323518] [2022-04-15 12:19:29,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233323518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:29,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:29,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:19:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924695029] [2022-04-15 12:19:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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 36 [2022-04-15 12:19:29,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:29,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,987 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-15 12:19:29,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:19:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:19:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:19:29,989 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:35,389 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:19:35,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:19:35,389 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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 36 [2022-04-15 12:19:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 12:19:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 12:19:35,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-15 12:19:35,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:35,464 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:19:35,464 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:19:35,465 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1667, Invalid=4975, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:19:35,466 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:35,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:19:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:19:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 12:19:35,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:35,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,508 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,508 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:35,509 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:19:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:19:35,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:35,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:35,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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 38 states. [2022-04-15 12:19:35,509 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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 38 states. [2022-04-15 12:19:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:35,510 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:19:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:19:35,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:35,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:35,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:35,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 12:19:35,511 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 12:19:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:35,511 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 12:19:35,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:35,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 12:19:35,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:19:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:19:35,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:35,612 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:35,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:35,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-15 12:19:35,815 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 51 times [2022-04-15 12:19:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:35,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [895152606] [2022-04-15 12:19:35,855 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-15 12:19:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:35,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883075074] [2022-04-15 12:19:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:35,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:35,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 52 times [2022-04-15 12:19:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:35,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154160416] [2022-04-15 12:19:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:36,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {9608#(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(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 12:19:36,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 12:19:36,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 12:19:36,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:36,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {9608#(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(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 12:19:36,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 12:19:36,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 12:19:36,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-15 12:19:36,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {9576#true} ~x~0 := 268435441; {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:36,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:36,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:36,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:36,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:36,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:36,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:36,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:36,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:36,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:36,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:36,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:36,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:36,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:36,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:36,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:36,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:36,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:36,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:36,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:36,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:36,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:36,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:36,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:36,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:19:36,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:19:36,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9607#(and (<= (div main_~x~0 4294967296) 0) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:19:36,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {9607#(and (<= (div main_~x~0 4294967296) 0) (<= 268435389 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {9577#false} is VALID [2022-04-15 12:19:36,626 INFO L272 TraceCheckUtils]: 33: Hoare triple {9577#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9577#false} is VALID [2022-04-15 12:19:36,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-15 12:19:36,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-15 12:19:36,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-15 12:19:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154160416] [2022-04-15 12:19:36,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154160416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824654831] [2022-04-15 12:19:36,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:36,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:36,628 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:36,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:19:36,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:36,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:36,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 12:19:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:36,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:37,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9576#true} is VALID [2022-04-15 12:19:37,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {9576#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(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 12:19:37,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 12:19:37,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 12:19:37,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-15 12:19:37,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {9576#true} ~x~0 := 268435441; {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:37,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:37,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:37,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:37,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:37,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:37,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:37,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:37,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:37,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:37,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:37,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:37,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:37,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:37,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:37,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:37,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:37,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:37,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:37,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:37,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:37,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:37,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:37,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:37,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:19:37,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:19:37,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9705#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:19:37,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {9705#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {9577#false} is VALID [2022-04-15 12:19:37,197 INFO L272 TraceCheckUtils]: 33: Hoare triple {9577#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9577#false} is VALID [2022-04-15 12:19:37,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-15 12:19:37,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-15 12:19:37,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-15 12:19:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:37,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:41,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-15 12:19:41,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-15 12:19:41,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-15 12:19:41,156 INFO L272 TraceCheckUtils]: 33: Hoare triple {9577#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9577#false} is VALID [2022-04-15 12:19:41,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {9733#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {9577#false} is VALID [2022-04-15 12:19:41,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {9737#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9733#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:19:41,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {9741#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9737#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:19:41,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {9745#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9741#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {9749#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9745#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {9753#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9749#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {9757#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9753#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:19:41,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {9761#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9757#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:19:41,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {9765#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9761#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {9769#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9765#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:19:41,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {9773#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9769#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:19:41,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {9777#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9773#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {9781#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9777#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {9785#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9781#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {9789#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9785#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:19:41,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {9793#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9789#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:19:41,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {9797#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9793#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:19:41,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9797#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:19:41,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {9805#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9801#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:19:41,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {9809#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9805#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {9813#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9809#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:19:41,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {9817#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9813#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:19:41,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {9821#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9817#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {9825#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9821#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:19:41,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {9829#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9825#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {9833#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9829#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 12:19:41,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {9837#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9833#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 12:19:41,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {9576#true} ~x~0 := 268435441; {9837#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 12:19:41,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-15 12:19:41,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 12:19:41,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 12:19:41,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {9576#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(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 12:19:41,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9576#true} is VALID [2022-04-15 12:19:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:41,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824654831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:41,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:41,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 12:19:41,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:41,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [895152606] [2022-04-15 12:19:41,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [895152606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:41,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:41,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:19:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999796388] [2022-04-15 12:19:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:41,319 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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 37 [2022-04-15 12:19:41,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:41,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:41,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:41,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:19:41,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:41,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:19:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:19:41,382 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:51,065 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:19:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:19:51,066 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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 37 [2022-04-15 12:19:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 12:19:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 12:19:51,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-15 12:19:51,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:51,150 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:19:51,150 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:19:51,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 12:19:51,152 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:51,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 12:19:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:19:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:19:51,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:51,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,194 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,195 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:51,195 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:19:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:19:51,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:51,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:51,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 39 states. [2022-04-15 12:19:51,196 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 39 states. [2022-04-15 12:19:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:51,196 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:19:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:19:51,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:51,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:51,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:51,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 12:19:51,197 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 12:19:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:51,198 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 12:19:51,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:51,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 12:19:51,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:19:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:19:51,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:51,339 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:51,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:51,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53 [2022-04-15 12:19:51,540 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 53 times [2022-04-15 12:19:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:51,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436618042] [2022-04-15 12:19:51,581 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-15 12:19:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:51,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553672413] [2022-04-15 12:19:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:51,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:51,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:51,594 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 54 times [2022-04-15 12:19:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:51,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095411926] [2022-04-15 12:19:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:52,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {10189#(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(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 12:19:52,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 12:19:52,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 12:19:52,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:52,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {10189#(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(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 12:19:52,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 12:19:52,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 12:19:52,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-15 12:19:52,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {10156#true} ~x~0 := 268435441; {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:52,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:52,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:52,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:52,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:52,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:52,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:52,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:52,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:52,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:52,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:52,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:52,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:52,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:52,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:52,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:52,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:52,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:52,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:52,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:52,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:52,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:52,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:52,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:52,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:19:52,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:19:52,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:19:52,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10188#(and (<= (div main_~x~0 4294967296) 0) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:19:52,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {10188#(and (<= (div main_~x~0 4294967296) 0) (<= 268435387 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {10157#false} is VALID [2022-04-15 12:19:52,871 INFO L272 TraceCheckUtils]: 34: Hoare triple {10157#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10157#false} is VALID [2022-04-15 12:19:52,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-15 12:19:52,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-15 12:19:52,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-15 12:19:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095411926] [2022-04-15 12:19:52,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095411926] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471159075] [2022-04-15 12:19:52,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:52,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:52,874 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:52,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:19:55,090 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 12:19:55,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:55,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 12:19:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:55,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:55,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10156#true} is VALID [2022-04-15 12:19:55,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {10156#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(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 12:19:55,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 12:19:55,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 12:19:55,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-15 12:19:55,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {10156#true} ~x~0 := 268435441; {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:19:55,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:19:55,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:19:55,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:19:55,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:19:55,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:19:55,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:19:55,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:19:55,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:19:55,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:19:55,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:19:55,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:19:55,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:19:55,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:19:55,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:19:55,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:19:55,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:19:55,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:19:55,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:19:55,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:19:55,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:19:55,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:19:55,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:19:55,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:19:55,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:19:55,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:19:55,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:19:55,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10289#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:19:55,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {10289#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {10157#false} is VALID [2022-04-15 12:19:55,698 INFO L272 TraceCheckUtils]: 34: Hoare triple {10157#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10157#false} is VALID [2022-04-15 12:19:55,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-15 12:19:55,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-15 12:19:55,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-15 12:19:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:55,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:00,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-15 12:20:00,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-15 12:20:00,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-15 12:20:00,755 INFO L272 TraceCheckUtils]: 34: Hoare triple {10157#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10157#false} is VALID [2022-04-15 12:20:00,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {10317#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {10157#false} is VALID [2022-04-15 12:20:00,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {10321#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10317#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:20:00,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {10325#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10321#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:20:00,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {10329#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10325#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {10333#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10329#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {10337#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10333#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {10341#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10337#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:20:00,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {10345#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10341#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:20:00,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {10349#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10345#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {10353#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10349#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:20:00,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {10357#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10353#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:20:00,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {10361#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10357#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {10365#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10361#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {10369#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10365#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {10373#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10369#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:20:00,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {10377#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10373#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:20:00,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10377#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:20:00,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {10385#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10381#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:20:00,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {10389#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10385#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:20:00,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {10393#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10389#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {10397#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10393#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:20:00,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {10401#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10397#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:20:00,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {10405#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10401#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {10409#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10405#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:20:00,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {10413#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10409#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {10417#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10413#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 12:20:00,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {10421#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10417#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:00,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {10425#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10421#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 12:20:00,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {10156#true} ~x~0 := 268435441; {10425#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 12:20:00,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-15 12:20:00,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 12:20:00,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 12:20:00,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {10156#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(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 12:20:00,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10156#true} is VALID [2022-04-15 12:20:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:00,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471159075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:00,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:00,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 12:20:00,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:00,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436618042] [2022-04-15 12:20:00,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436618042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:00,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:00,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:20:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856896839] [2022-04-15 12:20:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-15 12:20:00,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:00,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:01,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:01,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:20:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:20:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:20:01,007 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:09,858 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:20:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:20:09,859 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-15 12:20:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 12:20:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 12:20:09,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-15 12:20:09,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:09,959 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:20:09,959 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:20:09,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1907, Invalid=5749, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 12:20:09,960 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:09,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 12:20:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:20:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 12:20:10,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:10,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:10,028 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:10,028 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:10,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:10,029 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:20:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:20:10,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:10,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:10,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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 40 states. [2022-04-15 12:20:10,029 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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 40 states. [2022-04-15 12:20:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:10,030 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:20:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:20:10,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:10,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:10,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:10,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 12:20:10,032 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 12:20:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:10,032 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 12:20:10,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:10,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 12:20:10,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:20:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:20:10,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:10,203 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:10,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:20:10,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:10,404 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 55 times [2022-04-15 12:20:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:10,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983557285] [2022-04-15 12:20:10,451 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:20:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-15 12:20:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:10,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775179812] [2022-04-15 12:20:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:10,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:10,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 56 times [2022-04-15 12:20:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:10,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427044957] [2022-04-15 12:20:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:11,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {10786#(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(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 12:20:11,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 12:20:11,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 12:20:11,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:11,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {10786#(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(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 12:20:11,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 12:20:11,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 12:20:11,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-15 12:20:11,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {10752#true} ~x~0 := 268435441; {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:20:11,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:20:11,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:20:11,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:20:11,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:20:11,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:20:11,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:20:11,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:20:11,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:20:11,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:20:11,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:20:11,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:20:11,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:20:11,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:20:11,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:20:11,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:20:11,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:20:11,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:20:11,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:20:11,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:20:11,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:20:11,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:20:11,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:20:11,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:20:11,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:20:11,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:20:11,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:20:11,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:20:11,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10785#(and (<= (div main_~x~0 4294967296) 0) (<= 268435385 main_~x~0))} is VALID [2022-04-15 12:20:11,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {10785#(and (<= (div main_~x~0 4294967296) 0) (<= 268435385 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {10753#false} is VALID [2022-04-15 12:20:11,273 INFO L272 TraceCheckUtils]: 35: Hoare triple {10753#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10753#false} is VALID [2022-04-15 12:20:11,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-15 12:20:11,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-15 12:20:11,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-15 12:20:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:11,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:11,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427044957] [2022-04-15 12:20:11,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427044957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:11,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222770467] [2022-04-15 12:20:11,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:20:11,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:11,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:11,277 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:20:11,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:20:11,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:20:11,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:11,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 12:20:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:11,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:11,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10752#true} is VALID [2022-04-15 12:20:11,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {10752#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(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 12:20:11,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 12:20:11,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 12:20:11,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-15 12:20:11,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {10752#true} ~x~0 := 268435441; {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:20:11,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:20:11,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:20:11,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:20:11,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:20:11,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:20:11,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:20:11,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:20:11,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:20:11,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:20:11,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:20:11,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:20:11,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:20:11,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:20:11,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:20:11,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:20:11,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:20:11,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:20:11,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:20:11,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:20:11,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:20:11,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:20:11,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:20:11,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:20:11,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:20:11,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:20:11,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:20:11,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:20:11,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10889#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:20:11,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {10889#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !(~x~0 % 4294967296 > 1); {10753#false} is VALID [2022-04-15 12:20:11,836 INFO L272 TraceCheckUtils]: 35: Hoare triple {10753#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10753#false} is VALID [2022-04-15 12:20:11,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-15 12:20:11,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-15 12:20:11,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-15 12:20:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:11,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:17,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-15 12:20:17,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-15 12:20:17,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-15 12:20:17,464 INFO L272 TraceCheckUtils]: 35: Hoare triple {10753#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10753#false} is VALID [2022-04-15 12:20:17,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {10917#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {10753#false} is VALID [2022-04-15 12:20:17,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {10921#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10917#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:20:17,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {10925#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10921#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:20:17,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {10929#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10925#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {10933#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10929#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10933#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {10941#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10937#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:20:17,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {10945#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10941#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:20:17,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {10949#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10945#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {10953#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10949#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:20:17,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {10957#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10953#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:20:17,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {10961#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10957#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {10965#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10961#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {10969#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10965#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {10973#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10969#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:20:17,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {10977#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10973#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:20:17,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {10981#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10977#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:20:17,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {10985#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10981#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:20:17,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {10989#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10985#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:20:17,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {10993#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10989#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {10997#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10993#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:20:17,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {11001#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10997#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:20:17,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {11005#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11001#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {11009#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11005#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:20:17,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {11013#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11009#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {11017#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11013#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 12:20:17,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {11021#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11017#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {11025#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11021#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 12:20:17,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {11029#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11025#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 12:20:17,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {10752#true} ~x~0 := 268435441; {11029#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:17,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-15 12:20:17,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 12:20:17,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 12:20:17,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {10752#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(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 12:20:17,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10752#true} is VALID [2022-04-15 12:20:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222770467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:17,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:17,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 12:20:17,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983557285] [2022-04-15 12:20:17,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983557285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:17,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:17,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:20:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152824318] [2022-04-15 12:20:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:17,689 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-15 12:20:17,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:17,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:17,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:17,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:20:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:20:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 12:20:17,760 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:27,134 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:20:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:20:27,134 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-15 12:20:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 12:20:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 12:20:27,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-15 12:20:27,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:27,190 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:20:27,190 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:20:27,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2033, Invalid=6157, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 12:20:27,191 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:27,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 12:20:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:20:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:20:27,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:27,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,243 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,243 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:27,244 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:20:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:20:27,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:27,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:27,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 41 states. [2022-04-15 12:20:27,244 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 41 states. [2022-04-15 12:20:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:27,245 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:20:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:20:27,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:27,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:27,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:27,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 12:20:27,246 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 12:20:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:27,246 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 12:20:27,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 12:20:27,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:20:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:20:27,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:27,322 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:27,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:20:27,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:27,535 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:27,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:27,536 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 57 times [2022-04-15 12:20:27,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:27,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125480894] [2022-04-15 12:20:27,568 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:20:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-15 12:20:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:27,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180744862] [2022-04-15 12:20:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:27,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:27,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 58 times [2022-04-15 12:20:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:27,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164333887] [2022-04-15 12:20:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:28,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {11399#(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(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 12:20:28,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 12:20:28,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 12:20:28,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:28,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {11399#(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(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 12:20:28,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 12:20:28,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 12:20:28,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-15 12:20:28,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {11364#true} ~x~0 := 268435441; {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:20:28,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:20:28,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:20:28,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:20:28,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:20:28,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:20:28,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:20:28,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:20:28,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:20:28,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:20:28,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:20:28,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:20:28,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:20:28,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:20:28,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:20:28,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:20:28,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:20:28,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:20:28,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:20:28,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:20:28,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:20:28,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:20:28,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:20:28,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:20:28,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:20:28,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:20:28,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:20:28,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:20:28,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:20:28,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11398#(and (<= 268435383 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:20:28,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {11398#(and (<= 268435383 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {11365#false} is VALID [2022-04-15 12:20:28,447 INFO L272 TraceCheckUtils]: 36: Hoare triple {11365#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11365#false} is VALID [2022-04-15 12:20:28,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-15 12:20:28,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-15 12:20:28,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-15 12:20:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:28,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164333887] [2022-04-15 12:20:28,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164333887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:28,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784440403] [2022-04-15 12:20:28,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:20:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:28,451 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:20:28,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:20:28,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:20:28,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:28,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 12:20:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:28,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:29,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11364#true} is VALID [2022-04-15 12:20:29,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {11364#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(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 12:20:29,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 12:20:29,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 12:20:29,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-15 12:20:29,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {11364#true} ~x~0 := 268435441; {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:20:29,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:20:29,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:20:29,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:20:29,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:20:29,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:20:29,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:20:29,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:20:29,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:20:29,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:20:29,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:20:29,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:20:29,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:20:29,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:20:29,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:20:29,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:20:29,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:20:29,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:20:29,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:20:29,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:20:29,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:20:29,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:20:29,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:20:29,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:20:29,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:20:29,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:20:29,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:20:29,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:20:29,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:20:29,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11505#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:20:29,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {11505#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !(~x~0 % 4294967296 > 1); {11365#false} is VALID [2022-04-15 12:20:29,406 INFO L272 TraceCheckUtils]: 36: Hoare triple {11365#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11365#false} is VALID [2022-04-15 12:20:29,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-15 12:20:29,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-15 12:20:29,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-15 12:20:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:29,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:38,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-15 12:20:38,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-15 12:20:38,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-15 12:20:38,368 INFO L272 TraceCheckUtils]: 36: Hoare triple {11365#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11365#false} is VALID [2022-04-15 12:20:38,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {11533#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {11365#false} is VALID [2022-04-15 12:20:38,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {11537#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11533#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:20:38,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {11541#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11537#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:20:38,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {11545#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11541#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {11549#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11545#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {11553#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11549#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {11557#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11553#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:20:38,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {11561#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11557#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:20:38,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {11565#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11561#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {11569#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11565#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:20:38,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {11573#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11569#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:20:38,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {11577#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11573#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {11581#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11577#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {11585#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11581#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {11589#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11585#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:20:38,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {11593#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11589#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:20:38,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {11597#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11593#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:20:38,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {11601#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11597#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:20:38,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {11605#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11601#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:20:38,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {11609#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11605#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {11613#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11609#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:20:38,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {11617#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11613#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:20:38,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {11621#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11617#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {11625#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11621#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:20:38,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {11629#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11625#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {11633#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11629#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 12:20:38,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {11637#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11633#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {11641#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11637#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 12:20:38,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {11645#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11641#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 12:20:38,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {11649#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11645#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {11364#true} ~x~0 := 268435441; {11649#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 12:20:38,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-15 12:20:38,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 12:20:38,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 12:20:38,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {11364#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(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 12:20:38,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11364#true} is VALID [2022-04-15 12:20:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:38,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784440403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:38,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:38,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 12:20:38,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:38,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2125480894] [2022-04-15 12:20:38,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2125480894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:38,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:38,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:20:38,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96107449] [2022-04-15 12:20:38,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:38,636 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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 40 [2022-04-15 12:20:38,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:38,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:38,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:38,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:20:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:38,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:20:38,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:20:38,731 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:00,159 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:21:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:21:00,160 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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 40 [2022-04-15 12:21:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 12:21:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 12:21:00,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-15 12:21:00,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:00,267 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:21:00,267 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 12:21:00,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 12:21:00,268 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:00,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 12:21:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 12:21:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 12:21:00,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:00,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,310 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,310 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:00,310 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:21:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:21:00,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:00,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:00,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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 42 states. [2022-04-15 12:21:00,311 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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 42 states. [2022-04-15 12:21:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:00,312 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:21:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:21:00,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:00,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:00,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:00,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 12:21:00,313 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 12:21:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:00,313 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 12:21:00,313 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 12:21:00,496 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-15 12:21:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:21:00,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:21:00,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:00,496 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:00,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 12:21:00,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2022-04-15 12:21:00,697 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 59 times [2022-04-15 12:21:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:00,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690271554] [2022-04-15 12:21:00,730 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:21:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-15 12:21:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:00,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776377906] [2022-04-15 12:21:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:00,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:21:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:00,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:21:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 60 times [2022-04-15 12:21:00,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:00,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320588220] [2022-04-15 12:21:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:01,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:01,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {12028#(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(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 12:21:01,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 12:21:01,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 12:21:01,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {12028#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:01,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {12028#(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(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 12:21:01,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 12:21:01,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 12:21:01,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-15 12:21:01,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {11992#true} ~x~0 := 268435441; {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:21:01,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:21:01,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:21:01,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:21:01,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:21:01,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:21:01,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:21:01,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:21:01,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:21:01,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:21:01,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:21:01,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:21:01,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:21:01,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:21:01,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:21:01,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:21:01,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:21:01,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:21:01,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:21:01,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:21:01,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:21:01,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:21:01,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:21:01,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:21:01,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:21:01,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:21:01,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:21:01,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:21:01,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:21:01,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:21:01,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12027#(and (<= (div main_~x~0 4294967296) 0) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:21:01,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {12027#(and (<= (div main_~x~0 4294967296) 0) (<= 268435381 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {11993#false} is VALID [2022-04-15 12:21:01,729 INFO L272 TraceCheckUtils]: 37: Hoare triple {11993#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11993#false} is VALID [2022-04-15 12:21:01,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {11993#false} ~cond := #in~cond; {11993#false} is VALID [2022-04-15 12:21:01,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {11993#false} assume 0 == ~cond; {11993#false} is VALID [2022-04-15 12:21:01,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-15 12:21:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:01,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320588220] [2022-04-15 12:21:01,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320588220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214284090] [2022-04-15 12:21:01,730 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:21:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:01,731 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:21:01,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 12:21:03,820 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 12:21:03,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:03,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 12:21:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:03,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:04,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {11992#true} is VALID [2022-04-15 12:21:04,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#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(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 12:21:04,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 12:21:04,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 12:21:04,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-15 12:21:04,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {11992#true} ~x~0 := 268435441; {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:21:04,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:21:04,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:21:04,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:21:04,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:21:04,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:21:04,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:21:04,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:21:04,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:21:04,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:21:04,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:21:04,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:21:04,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:21:04,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:21:04,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:21:04,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:21:04,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:21:04,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:21:04,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:21:04,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:21:04,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:21:04,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:21:04,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:21:04,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:21:04,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:21:04,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:21:04,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:21:04,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:21:04,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:21:04,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:21:04,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12137#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:21:04,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {12137#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {11993#false} is VALID [2022-04-15 12:21:04,469 INFO L272 TraceCheckUtils]: 37: Hoare triple {11993#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11993#false} is VALID [2022-04-15 12:21:04,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {11993#false} ~cond := #in~cond; {11993#false} is VALID [2022-04-15 12:21:04,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {11993#false} assume 0 == ~cond; {11993#false} is VALID [2022-04-15 12:21:04,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-15 12:21:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:04,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:23,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-15 12:21:23,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {12156#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11993#false} is VALID [2022-04-15 12:21:23,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {12160#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12156#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:21:23,829 INFO L272 TraceCheckUtils]: 37: Hoare triple {12164#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12160#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:23,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {12168#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {12164#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:21:23,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {12172#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12168#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {12176#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12172#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {12180#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12176#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {12184#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12180#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {12188#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12184#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {12192#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12188#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {12196#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12192#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {12200#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12196#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {12204#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12200#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:23,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {12208#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12204#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {12212#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12208#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {12216#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12212#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {12220#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12216#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {12224#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12220#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {12228#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12224#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {12232#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12228#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {12236#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12232#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {12240#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12236#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {12244#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12240#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {12248#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12244#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {12252#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12248#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {12256#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12252#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {12260#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12256#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {12264#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12260#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {12268#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12264#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {12272#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12268#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {12276#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12272#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {12280#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12276#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {12284#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12280#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {12288#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12284#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {11992#true} ~x~0 := 268435441; {12288#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:24,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-15 12:21:24,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 12:21:24,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 12:21:24,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#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(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 12:21:24,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {11992#true} is VALID [2022-04-15 12:21:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:24,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214284090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:24,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:24,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 36] total 69 [2022-04-15 12:21:24,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:24,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690271554] [2022-04-15 12:21:24,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690271554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:24,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:24,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:21:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326088531] [2022-04-15 12:21:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:24,247 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-15 12:21:24,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:24,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:24,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:24,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:21:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:21:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3503, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:21:24,348 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:37,848 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:21:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:21:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-15 12:21:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 12:21:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 12:21:37,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-15 12:21:37,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:37,930 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:21:37,930 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:21:37,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2334, Invalid=7566, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 12:21:37,931 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:37,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 12:21:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:21:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:21:37,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:37,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,977 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,977 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:37,978 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:21:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:21:37,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:37,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:37,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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 43 states. [2022-04-15 12:21:37,978 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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 43 states. [2022-04-15 12:21:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:37,979 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:21:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:21:37,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:37,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:37,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:37,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 12:21:37,980 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 12:21:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:37,980 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 12:21:37,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:37,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 12:21:38,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:21:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:21:38,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:38,122 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:38,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:21:38,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61 [2022-04-15 12:21:38,328 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 61 times [2022-04-15 12:21:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:38,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [118334993] [2022-04-15 12:21:38,363 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:21:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-15 12:21:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:38,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063396680] [2022-04-15 12:21:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:38,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:21:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:38,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:21:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 62 times [2022-04-15 12:21:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:38,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994317703] [2022-04-15 12:21:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:39,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {12676#(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(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 12:21:39,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 12:21:39,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 12:21:39,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:39,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {12676#(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(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 12:21:39,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 12:21:39,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 12:21:39,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-15 12:21:39,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {12639#true} ~x~0 := 268435441; {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:21:39,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:21:39,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:21:39,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:21:39,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:21:39,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:21:39,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:21:39,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:21:39,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:21:39,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:21:39,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:21:39,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:21:39,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:21:39,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:21:39,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:21:39,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:21:39,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:21:39,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:21:39,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:21:39,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:21:39,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:21:39,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:21:39,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:21:39,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:21:39,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:21:39,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:21:39,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:21:39,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:21:39,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:21:39,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:21:39,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:21:39,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12675#(and (<= (div main_~x~0 4294967296) 0) (<= 268435379 main_~x~0))} is VALID [2022-04-15 12:21:39,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {12675#(and (<= (div main_~x~0 4294967296) 0) (<= 268435379 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {12640#false} is VALID [2022-04-15 12:21:39,212 INFO L272 TraceCheckUtils]: 38: Hoare triple {12640#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12640#false} is VALID [2022-04-15 12:21:39,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2022-04-15 12:21:39,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2022-04-15 12:21:39,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-15 12:21:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:39,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:39,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994317703] [2022-04-15 12:21:39,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994317703] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:39,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79566925] [2022-04-15 12:21:39,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:21:39,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:39,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:39,214 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:21:39,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 12:21:39,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:21:39,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:39,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 12:21:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:39,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:39,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2022-04-15 12:21:39,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#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(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 12:21:39,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 12:21:39,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 12:21:39,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-15 12:21:39,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {12639#true} ~x~0 := 268435441; {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:21:39,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:21:39,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:21:39,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:21:39,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:21:39,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:21:39,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:21:39,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:21:39,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:21:39,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:21:39,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:21:39,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:21:39,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:21:39,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:21:39,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:21:39,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:21:39,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:21:39,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:21:39,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:21:39,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:21:39,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:21:39,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:21:39,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:21:39,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:21:39,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:21:39,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:21:39,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:21:39,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:21:39,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:21:39,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:21:39,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:21:39,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12788#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:21:39,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {12788#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !(~x~0 % 4294967296 > 1); {12640#false} is VALID [2022-04-15 12:21:39,786 INFO L272 TraceCheckUtils]: 38: Hoare triple {12640#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12640#false} is VALID [2022-04-15 12:21:39,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2022-04-15 12:21:39,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2022-04-15 12:21:39,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-15 12:21:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:39,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:50,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-15 12:21:50,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {12807#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12640#false} is VALID [2022-04-15 12:21:50,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {12811#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12807#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:21:50,521 INFO L272 TraceCheckUtils]: 38: Hoare triple {12815#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12811#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:50,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {12819#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {12815#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:21:50,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {12823#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12819#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {12827#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12823#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {12831#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12827#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {12835#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12831#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {12839#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12835#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {12843#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12839#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {12847#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12843#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {12851#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12847#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {12855#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12851#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {12859#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12855#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {12863#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12859#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {12867#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12863#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {12871#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12867#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {12875#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12871#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {12879#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12875#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {12883#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12879#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {12887#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12883#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {12891#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12887#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {12895#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12891#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {12899#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12895#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {12903#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12899#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {12907#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12903#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {12911#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12907#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {12915#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12911#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {12919#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12915#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {12923#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12919#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {12927#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12923#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {12931#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12927#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {12935#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12931#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {12939#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12935#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {12943#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12939#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {12639#true} ~x~0 := 268435441; {12943#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:50,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-15 12:21:50,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 12:21:50,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 12:21:50,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#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(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 12:21:50,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2022-04-15 12:21:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:50,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79566925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:50,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:50,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 37] total 71 [2022-04-15 12:21:50,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:50,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [118334993] [2022-04-15 12:21:50,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [118334993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:50,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:50,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:21:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872297319] [2022-04-15 12:21:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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 42 [2022-04-15 12:21:50,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:50,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:50,885 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-15 12:21:50,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:21:50,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:21:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3711, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 12:21:50,887 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:17,167 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:22:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:22:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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 42 [2022-04-15 12:22:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 12:22:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 12:22:17,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-15 12:22:17,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:17,303 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:22:17,303 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:22:17,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=2473, Invalid=8033, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 12:22:17,304 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:17,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-04-15 12:22:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:22:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 12:22:17,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:17,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,349 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,349 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:17,350 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:22:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:22:17,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:17,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:17,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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 44 states. [2022-04-15 12:22:17,350 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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 44 states. [2022-04-15 12:22:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:17,351 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:22:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:22:17,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:17,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:17,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:17,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 12:22:17,352 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 12:22:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:17,352 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 12:22:17,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:17,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 12:22:17,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:22:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:22:17,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:17,595 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:17,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 12:22:17,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:17,795 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 63 times [2022-04-15 12:22:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:17,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544355182] [2022-04-15 12:22:17,838 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:22:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-15 12:22:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:17,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597107169] [2022-04-15 12:22:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:22:17,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:22:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:22:17,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:22:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 64 times [2022-04-15 12:22:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:17,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514995146] [2022-04-15 12:22:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:18,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {13340#(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(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 12:22:18,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 12:22:18,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 12:22:18,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:18,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {13340#(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(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 12:22:18,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 12:22:18,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 12:22:18,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-15 12:22:18,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~x~0 := 268435441; {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:22:18,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:22:18,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:22:18,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:22:18,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:22:18,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:22:18,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:22:18,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:22:18,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:22:18,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:22:18,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:22:18,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:22:18,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:22:18,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:22:18,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:22:18,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:22:18,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:22:18,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:22:18,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:22:18,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:22:18,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:22:18,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:22:18,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:22:18,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:22:19,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:22:19,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:22:19,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:22:19,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:22:19,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:22:19,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:22:19,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:22:19,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:22:19,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13339#(and (<= (div main_~x~0 4294967296) 0) (<= 268435377 main_~x~0))} is VALID [2022-04-15 12:22:19,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {13339#(and (<= (div main_~x~0 4294967296) 0) (<= 268435377 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {13303#false} is VALID [2022-04-15 12:22:19,139 INFO L272 TraceCheckUtils]: 39: Hoare triple {13303#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13303#false} is VALID [2022-04-15 12:22:19,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-15 12:22:19,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-15 12:22:19,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-15 12:22:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:19,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514995146] [2022-04-15 12:22:19,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514995146] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:19,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145996713] [2022-04-15 12:22:19,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:22:19,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:19,141 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:22:19,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 12:22:19,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:22:19,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:19,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 12:22:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:19,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-15 12:22:19,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#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(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 12:22:19,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 12:22:19,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 12:22:19,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-15 12:22:19,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~x~0 := 268435441; {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:22:19,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:22:19,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:22:19,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:22:19,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:22:19,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:22:19,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:22:19,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:22:19,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:22:19,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:22:19,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:22:19,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:22:19,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:22:19,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:22:19,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:22:19,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:22:19,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:22:19,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:22:19,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:22:19,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:22:20,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:22:20,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:22:20,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:22:20,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:22:20,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:22:20,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:22:20,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:22:20,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:22:20,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:22:20,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:22:20,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:22:20,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:22:20,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13455#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:22:20,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {13455#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !(~x~0 % 4294967296 > 1); {13303#false} is VALID [2022-04-15 12:22:20,225 INFO L272 TraceCheckUtils]: 39: Hoare triple {13303#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13303#false} is VALID [2022-04-15 12:22:20,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-15 12:22:20,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-15 12:22:20,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-15 12:22:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:20,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:41,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-15 12:22:41,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-15 12:22:41,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-15 12:22:41,099 INFO L272 TraceCheckUtils]: 39: Hoare triple {13303#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13303#false} is VALID [2022-04-15 12:22:41,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {13483#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {13303#false} is VALID [2022-04-15 12:22:41,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {13487#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13483#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:22:41,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {13491#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13487#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:22:41,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {13495#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13491#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {13499#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13495#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {13503#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13499#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {13507#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13503#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:22:41,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {13511#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13507#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:22:41,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {13515#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13511#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {13519#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13515#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:22:41,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {13523#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13519#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:22:41,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {13527#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13523#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {13531#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13527#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {13535#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13531#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {13539#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13535#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:22:41,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {13543#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13539#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:22:41,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {13547#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13543#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:22:41,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {13551#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13547#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:22:41,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {13555#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13551#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:22:41,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {13559#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13555#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {13563#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13559#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:22:41,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {13567#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13563#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:22:41,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {13571#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13567#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {13575#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13571#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:22:41,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {13579#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13575#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {13583#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13579#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 12:22:41,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {13587#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13583#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {13591#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13587#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 12:22:41,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {13595#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13591#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 12:22:41,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {13599#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13595#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {13603#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13599#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 12:22:41,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {13607#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13603#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 12:22:41,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {13611#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13607#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 12:22:41,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~x~0 := 268435441; {13611#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 12:22:41,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-15 12:22:41,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 12:22:41,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 12:22:41,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#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(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 12:22:41,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-15 12:22:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:41,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145996713] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:41,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:41,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-15 12:22:41,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:41,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544355182] [2022-04-15 12:22:41,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544355182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:41,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:41,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:22:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022828294] [2022-04-15 12:22:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:41,648 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-15 12:22:41,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:41,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:41,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:41,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:22:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:22:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3538, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:22:41,749 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:06,812 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:23:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:23:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-15 12:23:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 12:23:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 12:23:06,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-15 12:23:06,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:06,919 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:23:06,919 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:23:06,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=2577, Invalid=7929, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 12:23:06,921 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:06,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-04-15 12:23:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:23:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:23:06,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:06,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,963 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,963 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:06,964 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:23:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:23:06,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:06,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:06,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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 45 states. [2022-04-15 12:23:06,964 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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 45 states. [2022-04-15 12:23:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:06,965 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:23:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:23:06,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:06,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:06,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:06,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 12:23:06,966 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 12:23:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:06,966 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 12:23:06,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 12:23:07,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:23:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:23:07,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:07,216 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:07,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 12:23:07,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:07,417 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 65 times [2022-04-15 12:23:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:07,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989211320] [2022-04-15 12:23:07,458 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:23:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-15 12:23:07,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452025934] [2022-04-15 12:23:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:07,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:23:07,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:23:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:23:07,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:23:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 66 times [2022-04-15 12:23:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:07,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148714461] [2022-04-15 12:23:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:08,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {14017#(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(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 12:23:08,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 12:23:08,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 12:23:08,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {14017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:08,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {14017#(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(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 12:23:08,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 12:23:08,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 12:23:08,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-15 12:23:08,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {13978#true} ~x~0 := 268435441; {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:23:08,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:23:08,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:23:08,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:23:08,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:23:08,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:23:08,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:23:08,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:23:08,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:23:08,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:23:08,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:23:08,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:23:08,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:23:08,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:23:08,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:23:08,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:23:08,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:23:08,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:23:08,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:23:08,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:23:08,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:23:08,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:23:08,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:23:08,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:23:08,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:23:08,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:23:08,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:23:08,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:23:08,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:23:08,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:23:08,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:23:08,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:23:08,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:23:08,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14016#(and (<= (div main_~x~0 4294967296) 0) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:23:08,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {14016#(and (<= (div main_~x~0 4294967296) 0) (<= 268435375 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {13979#false} is VALID [2022-04-15 12:23:08,552 INFO L272 TraceCheckUtils]: 40: Hoare triple {13979#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13979#false} is VALID [2022-04-15 12:23:08,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {13979#false} ~cond := #in~cond; {13979#false} is VALID [2022-04-15 12:23:08,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {13979#false} assume 0 == ~cond; {13979#false} is VALID [2022-04-15 12:23:08,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-15 12:23:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:23:08,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:08,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148714461] [2022-04-15 12:23:08,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148714461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:08,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578506034] [2022-04-15 12:23:08,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:23:08,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:08,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:08,554 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:23:08,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 12:23:09,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-15 12:23:09,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:09,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-15 12:23:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:09,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:09,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {13978#true} is VALID [2022-04-15 12:23:09,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {13978#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(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 12:23:09,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 12:23:09,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 12:23:09,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-15 12:23:09,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {13978#true} ~x~0 := 268435441; {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:23:09,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:23:09,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:23:09,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:23:09,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:23:09,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:23:10,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:23:10,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:23:10,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:23:10,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:23:10,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:23:10,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:23:10,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:23:10,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:23:10,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:23:10,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:23:10,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:23:10,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:23:10,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:23:10,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:23:10,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:23:10,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:23:10,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:23:10,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:23:10,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:23:10,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:23:10,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:23:10,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:23:10,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:23:10,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:23:10,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:23:10,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:23:10,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:23:10,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14135#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:23:10,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {14135#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {13979#false} is VALID [2022-04-15 12:23:10,291 INFO L272 TraceCheckUtils]: 40: Hoare triple {13979#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13979#false} is VALID [2022-04-15 12:23:10,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {13979#false} ~cond := #in~cond; {13979#false} is VALID [2022-04-15 12:23:10,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {13979#false} assume 0 == ~cond; {13979#false} is VALID [2022-04-15 12:23:10,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-15 12:23:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:23:10,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:39,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-15 12:23:39,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {14154#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13979#false} is VALID [2022-04-15 12:23:39,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {14158#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14154#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:23:39,854 INFO L272 TraceCheckUtils]: 40: Hoare triple {14162#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14158#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:23:39,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {14166#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {14162#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:23:39,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {14170#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14166#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:39,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {14174#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14170#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:39,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {14178#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14174#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:39,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {14182#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14178#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:39,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {14186#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14182#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:39,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {14190#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14186#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {14194#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14190#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {14198#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14194#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {14202#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14198#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {14206#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14202#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {14210#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14206#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {14214#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14210#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {14218#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14214#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {14222#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14218#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {14226#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14222#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {14230#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14226#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {14234#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14230#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {14238#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14234#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {14242#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14238#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {14246#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14242#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {14250#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14246#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {14254#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14250#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {14258#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14254#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {14262#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14258#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {14266#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14262#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {14270#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14266#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {14274#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14270#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {14278#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14274#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {14282#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14278#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {14286#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14282#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {14290#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14286#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {14294#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14290#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {14298#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14294#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {13978#true} ~x~0 := 268435441; {14298#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:23:40,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-15 12:23:40,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 12:23:40,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 12:23:40,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {13978#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(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 12:23:40,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {13978#true} is VALID [2022-04-15 12:23:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:23:40,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578506034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:40,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:40,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 39] total 75 [2022-04-15 12:23:40,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:40,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989211320] [2022-04-15 12:23:40,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989211320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:40,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:40,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:23:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903153068] [2022-04-15 12:23:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:40,522 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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 44 [2022-04-15 12:23:40,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:40,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:40,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:40,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:23:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:40,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:23:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=4145, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:23:40,652 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:32,367 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:24:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:24:32,367 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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 44 [2022-04-15 12:24:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 12:24:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 12:24:32,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 12:24:32,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:32,573 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:24:32,573 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 12:24:32,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=2763, Invalid=9009, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 12:24:32,575 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:32,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2022-04-15 12:24:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 12:24:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 12:24:32,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:32,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,628 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,628 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:32,629 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:24:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:24:32,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:32,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:32,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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 46 states. [2022-04-15 12:24:32,630 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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 46 states. [2022-04-15 12:24:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:32,631 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:24:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:24:32,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:32,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:32,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:32,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 12:24:32,634 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 12:24:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:32,634 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 12:24:32,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 12:24:32,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:24:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:24:32,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:32,936 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:32,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 12:24:33,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67 [2022-04-15 12:24:33,137 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 67 times [2022-04-15 12:24:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:33,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602225787] [2022-04-15 12:24:33,177 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:24:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-15 12:24:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:33,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768787413] [2022-04-15 12:24:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:33,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:24:33,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:24:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:24:33,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:24:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 68 times [2022-04-15 12:24:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:33,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79001242] [2022-04-15 12:24:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:33,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:34,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {14713#(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(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 12:24:34,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 12:24:34,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 12:24:34,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:34,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {14713#(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(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 12:24:34,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 12:24:34,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 12:24:34,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-15 12:24:34,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {14673#true} ~x~0 := 268435441; {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:24:34,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:24:34,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:24:34,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:24:34,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:24:34,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:24:34,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:24:34,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:24:34,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:24:34,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:24:34,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:24:34,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:24:34,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:24:34,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:24:34,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:24:34,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:24:34,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:24:34,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:24:34,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:24:34,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:24:34,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:24:34,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:24:34,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:24:34,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:24:34,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:24:34,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:24:34,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:24:34,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:24:34,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:24:34,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:24:34,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:24:34,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:24:34,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:24:34,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14712#(and (<= (div main_~x~0 4294967296) 0) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:24:34,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {14712#(and (<= (div main_~x~0 4294967296) 0) (<= 268435373 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {14674#false} is VALID [2022-04-15 12:24:34,763 INFO L272 TraceCheckUtils]: 41: Hoare triple {14674#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14674#false} is VALID [2022-04-15 12:24:34,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {14674#false} ~cond := #in~cond; {14674#false} is VALID [2022-04-15 12:24:34,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {14674#false} assume 0 == ~cond; {14674#false} is VALID [2022-04-15 12:24:34,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-15 12:24:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:24:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79001242] [2022-04-15 12:24:34,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79001242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:34,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593663650] [2022-04-15 12:24:34,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:24:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:34,765 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:24:34,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 12:24:34,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:24:34,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:34,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-15 12:24:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:34,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:35,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14673#true} is VALID [2022-04-15 12:24:35,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {14673#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(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 12:24:35,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 12:24:35,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 12:24:35,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-15 12:24:35,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {14673#true} ~x~0 := 268435441; {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:24:35,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:24:35,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:24:35,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:24:35,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:24:35,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:24:35,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:24:35,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:24:35,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:24:35,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:24:35,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:24:35,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:24:35,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:24:35,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:24:35,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:24:35,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:24:35,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:24:35,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:24:35,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:24:35,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:24:35,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:24:35,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:24:35,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:24:35,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:24:35,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:24:35,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:24:35,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:24:35,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:24:35,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:24:35,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:24:35,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:24:35,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:24:35,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:24:35,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:24:35,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14834#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:24:35,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {14834#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {14674#false} is VALID [2022-04-15 12:24:35,913 INFO L272 TraceCheckUtils]: 41: Hoare triple {14674#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14674#false} is VALID [2022-04-15 12:24:35,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {14674#false} ~cond := #in~cond; {14674#false} is VALID [2022-04-15 12:24:35,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {14674#false} assume 0 == ~cond; {14674#false} is VALID [2022-04-15 12:24:35,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-15 12:24:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:24:35,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:03,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-15 12:25:03,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {14853#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14674#false} is VALID [2022-04-15 12:25:03,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {14857#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14853#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:25:03,944 INFO L272 TraceCheckUtils]: 41: Hoare triple {14861#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14857#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:25:03,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {14865#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {14861#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:25:03,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {14869#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14865#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:03,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {14873#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14869#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:03,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {14877#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14873#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {14881#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14877#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {14885#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14881#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {14889#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14885#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {14893#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14889#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {14897#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14893#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {14901#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14897#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {14905#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14901#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {14909#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14905#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {14913#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14909#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {14917#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14913#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {14921#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14917#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {14925#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14921#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {14929#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14925#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {14933#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14929#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {14937#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14933#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14937#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {14945#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14941#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {14949#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14945#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {14953#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14949#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {14957#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14953#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {14961#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14957#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {14965#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14961#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {14969#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14965#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {14973#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14969#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {14977#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14973#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {14981#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14977#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {14985#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14981#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {14989#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14985#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {14993#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14989#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {14997#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14993#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {15001#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14997#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {14673#true} ~x~0 := 268435441; {15001#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:25:04,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-15 12:25:04,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 12:25:04,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 12:25:04,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {14673#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(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 12:25:04,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14673#true} is VALID [2022-04-15 12:25:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:25:04,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593663650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:04,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:04,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 40] total 77 [2022-04-15 12:25:04,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:04,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602225787] [2022-04-15 12:25:04,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602225787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:04,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:04,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:25:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617569684] [2022-04-15 12:25:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:04,417 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-15 12:25:04,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:04,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:04,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:04,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:25:04,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:04,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:25:04,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4371, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:25:04,516 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:55,089 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 12:25:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:25:55,089 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-15 12:25:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:25:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:25:55,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 12:25:55,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:55,261 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:25:55,261 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:25:55,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=2914, Invalid=9518, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 12:25:55,262 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:55,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-04-15 12:25:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:25:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:25:55,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:55,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,315 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,315 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:55,316 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:25:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:25:55,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:55,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:55,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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 47 states. [2022-04-15 12:25:55,316 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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 47 states. [2022-04-15 12:25:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:55,317 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:25:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:25:55,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:55,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:55,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:55,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 12:25:55,318 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 12:25:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:55,318 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 12:25:55,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:55,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 12:25:55,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:25:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:25:55,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:55,576 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:55,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 12:25:55,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2022-04-15 12:25:55,777 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 69 times [2022-04-15 12:25:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:55,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [477127002] [2022-04-15 12:25:55,811 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:25:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-15 12:25:55,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190123858] [2022-04-15 12:25:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:25:55,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:25:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:25:55,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:25:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 70 times [2022-04-15 12:25:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281637430] [2022-04-15 12:25:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:56,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {15425#(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(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 12:25:56,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 12:25:56,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 12:25:56,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:56,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {15425#(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(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 12:25:56,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 12:25:56,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 12:25:56,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-15 12:25:56,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {15384#true} ~x~0 := 268435441; {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:25:56,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:25:56,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:25:56,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:25:56,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:25:56,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:25:56,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:25:56,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:25:56,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:25:56,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:25:56,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:25:57,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:25:57,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:25:57,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:25:57,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:25:57,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:25:57,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:25:57,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:25:57,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:25:57,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:25:57,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:25:57,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:25:57,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:25:57,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:25:57,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:25:57,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:25:57,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:25:57,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:25:57,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:25:57,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:25:57,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:25:57,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:25:57,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:25:57,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:25:57,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:25:57,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435371 main_~x~0))} is VALID [2022-04-15 12:25:57,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {15424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435371 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {15385#false} is VALID [2022-04-15 12:25:57,621 INFO L272 TraceCheckUtils]: 42: Hoare triple {15385#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15385#false} is VALID [2022-04-15 12:25:57,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-15 12:25:57,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-15 12:25:57,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-15 12:25:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:25:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281637430] [2022-04-15 12:25:57,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281637430] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:25:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417197722] [2022-04-15 12:25:57,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:25:57,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:25:57,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:25:57,623 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:25:57,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 12:25:57,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:25:57,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:25:57,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 12:25:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:57,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:25:58,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15384#true} is VALID [2022-04-15 12:25:58,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {15384#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(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 12:25:58,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 12:25:58,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 12:25:58,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-15 12:25:58,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {15384#true} ~x~0 := 268435441; {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:25:58,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:25:58,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:25:58,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:25:58,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:25:58,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:25:58,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:25:58,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:25:58,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:25:58,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:25:58,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:25:58,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:25:58,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:25:58,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:25:58,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:25:58,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:25:59,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:25:59,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:25:59,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:25:59,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:25:59,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:25:59,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:25:59,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:25:59,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:25:59,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:25:59,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:25:59,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:25:59,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:25:59,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:25:59,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:25:59,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:25:59,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:25:59,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:25:59,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:25:59,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:25:59,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15549#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 12:25:59,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {15549#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !(~x~0 % 4294967296 > 1); {15385#false} is VALID [2022-04-15 12:25:59,536 INFO L272 TraceCheckUtils]: 42: Hoare triple {15385#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15385#false} is VALID [2022-04-15 12:25:59,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-15 12:25:59,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-15 12:25:59,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-15 12:25:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:25:59,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:26:52,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-15 12:26:52,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-15 12:26:52,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-15 12:26:52,843 INFO L272 TraceCheckUtils]: 42: Hoare triple {15385#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15385#false} is VALID [2022-04-15 12:26:52,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {15577#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {15385#false} is VALID [2022-04-15 12:26:52,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {15581#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15577#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:26:52,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {15585#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15581#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 12:26:52,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {15589#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15585#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:52,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {15593#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15589#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {15597#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15593#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {15601#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15597#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 12:26:53,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {15605#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15601#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 12:26:53,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {15609#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15605#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {15613#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15609#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 12:26:53,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {15617#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15613#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 12:26:53,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {15621#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15617#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {15625#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15621#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {15629#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15625#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {15633#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15629#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 12:26:53,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {15637#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15633#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 12:26:53,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {15641#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15637#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 12:26:53,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {15645#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15641#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 12:26:53,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {15649#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15645#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 12:26:53,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {15653#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15649#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {15657#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15653#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 12:26:53,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {15661#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15657#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 12:26:53,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {15665#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15661#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {15669#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15665#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 12:26:53,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {15673#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15669#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {15677#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15673#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 12:26:53,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {15681#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15677#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {15685#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15681#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 12:26:53,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {15689#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15685#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 12:26:53,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {15693#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15689#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {15697#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15693#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {15701#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15697#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 12:26:53,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {15705#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15701#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 12:26:53,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {15709#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15705#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 12:26:53,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {15713#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15709#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 12:26:53,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {15717#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15713#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 12:26:53,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {15384#true} ~x~0 := 268435441; {15717#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 12:26:53,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-15 12:26:53,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 12:26:53,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 12:26:53,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {15384#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(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 12:26:53,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15384#true} is VALID [2022-04-15 12:26:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:26:53,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417197722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:26:53,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:26:53,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-15 12:26:53,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:26:53,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [477127002] [2022-04-15 12:26:53,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [477127002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:26:53,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:26:53,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:26:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386246746] [2022-04-15 12:26:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:26:53,800 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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 46 [2022-04-15 12:26:53,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:26:53,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:53,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:53,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:26:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:26:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 12:26:53,974 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:51,035 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 12:27:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:27:51,035 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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 46 [2022-04-15 12:27:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 12:27:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 12:27:51,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-15 12:27:51,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:51,274 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:27:51,274 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 12:27:51,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 53.7s TimeCoverageRelationStatistics Valid=3027, Invalid=9405, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 12:27:51,275 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:51,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2022-04-15 12:27:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 12:27:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 12:27:51,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:51,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,335 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,335 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:51,336 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:27:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:27:51,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:51,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:51,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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 48 states. [2022-04-15 12:27:51,336 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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 48 states. [2022-04-15 12:27:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:51,337 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:27:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:27:51,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:51,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:51,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:51,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 12:27:51,338 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 12:27:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:51,338 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 12:27:51,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 12:27:51,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:27:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:27:51,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:51,714 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:51,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 12:27:51,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:51,914 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 71 times [2022-04-15 12:27:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:51,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221703474] [2022-04-15 12:27:51,967 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:27:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-15 12:27:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:51,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493828505] [2022-04-15 12:27:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:27:51,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:27:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:27:51,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:27:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 72 times [2022-04-15 12:27:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:51,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427097372] [2022-04-15 12:27:51,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:52,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:52,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {16150#(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(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 12:27:52,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 12:27:52,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 12:27:52,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:52,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {16150#(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(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 12:27:52,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 12:27:52,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 12:27:52,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-15 12:27:52,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {16108#true} ~x~0 := 268435441; {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:27:52,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:27:52,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:27:52,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:27:53,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:27:53,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:27:53,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:27:53,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:27:53,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:27:53,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:27:53,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:27:53,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:27:53,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:27:53,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:27:53,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:27:53,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:27:53,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:27:53,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:27:53,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:27:53,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:27:53,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:27:53,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:27:53,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:27:53,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:27:53,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:27:53,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:27:53,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:27:53,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:27:53,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:27:53,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:27:53,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:27:53,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:27:53,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:27:53,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:27:53,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:27:53,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 12:27:53,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16149#(and (<= (div main_~x~0 4294967296) 0) (<= 268435369 main_~x~0))} is VALID [2022-04-15 12:27:53,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {16149#(and (<= (div main_~x~0 4294967296) 0) (<= 268435369 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16109#false} is VALID [2022-04-15 12:27:53,934 INFO L272 TraceCheckUtils]: 43: Hoare triple {16109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16109#false} is VALID [2022-04-15 12:27:53,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {16109#false} ~cond := #in~cond; {16109#false} is VALID [2022-04-15 12:27:53,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {16109#false} assume 0 == ~cond; {16109#false} is VALID [2022-04-15 12:27:53,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-15 12:27:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:27:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:53,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427097372] [2022-04-15 12:27:53,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427097372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:53,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698696691] [2022-04-15 12:27:53,935 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:27:53,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:53,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:53,936 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:27:53,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 12:27:55,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 12:27:55,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:55,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-15 12:27:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:55,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:56,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16108#true} is VALID [2022-04-15 12:27:56,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {16108#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(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 12:27:56,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 12:27:56,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 12:27:56,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-15 12:27:56,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {16108#true} ~x~0 := 268435441; {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:27:56,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:27:56,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:27:56,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:27:56,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:27:56,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:27:56,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:27:56,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:27:56,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:27:56,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:27:56,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:27:56,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:27:56,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:27:56,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:27:56,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:27:56,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:27:56,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:27:56,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:27:56,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:27:56,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:27:56,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:27:56,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:27:57,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:27:57,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:27:57,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:27:57,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:27:57,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:27:57,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:27:57,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:27:57,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:27:57,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:27:57,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:27:57,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:27:57,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:27:57,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:27:57,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 12:27:57,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16277#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 12:27:57,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {16277#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16109#false} is VALID [2022-04-15 12:27:57,412 INFO L272 TraceCheckUtils]: 43: Hoare triple {16109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16109#false} is VALID [2022-04-15 12:27:57,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {16109#false} ~cond := #in~cond; {16109#false} is VALID [2022-04-15 12:27:57,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {16109#false} assume 0 == ~cond; {16109#false} is VALID [2022-04-15 12:27:57,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-15 12:27:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:27:57,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:28:51,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-15 12:28:51,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {16296#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16109#false} is VALID [2022-04-15 12:28:51,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {16300#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16296#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:28:51,956 INFO L272 TraceCheckUtils]: 43: Hoare triple {16304#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16300#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:28:51,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {16308#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {16304#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:28:51,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {16312#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16308#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {16316#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16312#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {16320#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16316#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {16324#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16320#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {16328#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16324#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {16332#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16328#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {16336#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16332#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {16340#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16336#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {16344#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16340#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {16348#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16344#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {16352#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16348#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {16356#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16352#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {16360#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16356#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {16364#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16360#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {16368#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16364#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {16372#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16368#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {16376#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16372#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {16380#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16376#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {16384#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16380#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {16388#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16384#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {16392#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16388#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {16396#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16392#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {16400#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16396#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {16404#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16400#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {16408#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16404#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {16412#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16408#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {16416#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16412#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {16420#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16416#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {16424#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16420#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {16428#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16424#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {16432#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16428#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {16436#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16432#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {16440#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16436#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {16444#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16440#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {16448#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16444#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {16452#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16448#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {16108#true} ~x~0 := 268435441; {16452#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:28:52,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-15 12:28:52,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 12:28:52,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 12:28:52,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {16108#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(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 12:28:52,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16108#true} is VALID [2022-04-15 12:28:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:28:52,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698696691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:28:52,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:28:52,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 42] total 81 [2022-04-15 12:28:52,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:28:52,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221703474] [2022-04-15 12:28:52,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221703474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:28:52,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:28:52,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:28:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186662539] [2022-04-15 12:28:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:28:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-15 12:28:52,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:28:52,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:28:52,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:28:52,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:28:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:28:52,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:28:52,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4841, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:28:52,810 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:46,477 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 12:29:46,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:29:46,477 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-15 12:29:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 12:29:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 12:29:46,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-15 12:29:46,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:46,686 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:29:46,686 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:29:46,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=3228, Invalid=10578, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 12:29:46,688 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:46,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2022-04-15 12:29:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:29:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:29:46,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:46,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,742 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,742 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:46,743 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:29:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:29:46,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:46,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:46,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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 49 states. [2022-04-15 12:29:46,744 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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 49 states. [2022-04-15 12:29:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:46,744 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:29:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:29:46,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:46,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:46,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:46,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 12:29:46,746 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 12:29:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:46,746 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 12:29:46,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:46,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 12:29:47,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:29:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 12:29:47,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:47,051 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:47,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 12:29:47,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:29:47,251 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:29:47,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 73 times [2022-04-15 12:29:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:47,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013136593] [2022-04-15 12:29:47,284 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:29:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-15 12:29:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:47,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873513408] [2022-04-15 12:29:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:29:47,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:29:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:29:47,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:29:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 74 times [2022-04-15 12:29:47,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:47,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587860071] [2022-04-15 12:29:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:48,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {16894#(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(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 12:29:48,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 12:29:48,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 12:29:48,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:29:48,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {16894#(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(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 12:29:48,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 12:29:48,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 12:29:48,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-15 12:29:48,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {16851#true} ~x~0 := 268435441; {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:29:48,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:29:48,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:29:48,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:29:48,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:29:48,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:29:48,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:29:48,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:29:48,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:29:48,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:29:48,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:29:48,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:29:48,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:29:48,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:29:48,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:29:48,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:29:48,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:29:48,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:29:48,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:29:48,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:29:48,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:29:48,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:29:48,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:29:48,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:29:48,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:29:48,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:29:48,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:29:48,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:29:48,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:29:48,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:29:48,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:29:48,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:29:48,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:29:48,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:29:48,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:29:48,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 12:29:48,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 12:29:48,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16893#(and (<= (div main_~x~0 4294967296) 0) (<= 268435367 main_~x~0))} is VALID [2022-04-15 12:29:48,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {16893#(and (<= (div main_~x~0 4294967296) 0) (<= 268435367 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16852#false} is VALID [2022-04-15 12:29:48,944 INFO L272 TraceCheckUtils]: 44: Hoare triple {16852#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16852#false} is VALID [2022-04-15 12:29:48,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {16852#false} ~cond := #in~cond; {16852#false} is VALID [2022-04-15 12:29:48,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {16852#false} assume 0 == ~cond; {16852#false} is VALID [2022-04-15 12:29:48,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-15 12:29:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:29:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587860071] [2022-04-15 12:29:48,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587860071] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:29:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678649747] [2022-04-15 12:29:48,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:29:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:29:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:29:48,946 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:29:48,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 12:29:48,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:29:48,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:29:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-15 12:29:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:49,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:29:49,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16851#true} is VALID [2022-04-15 12:29:49,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {16851#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(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 12:29:49,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 12:29:49,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 12:29:49,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-15 12:29:49,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {16851#true} ~x~0 := 268435441; {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:29:49,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:29:49,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:29:49,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:29:49,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:29:49,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:29:49,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:29:49,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:29:49,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:29:49,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:29:49,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:29:49,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:29:49,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:29:49,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:29:49,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:29:49,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:29:49,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:29:49,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:29:49,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:29:49,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:29:49,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:29:49,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:29:49,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:29:49,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:29:49,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:29:49,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:29:49,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:29:49,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:29:49,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:29:49,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:29:49,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:29:49,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:29:49,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:29:50,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:29:50,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:29:50,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 12:29:50,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 12:29:50,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17024#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 12:29:50,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {17024#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16852#false} is VALID [2022-04-15 12:29:50,079 INFO L272 TraceCheckUtils]: 44: Hoare triple {16852#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16852#false} is VALID [2022-04-15 12:29:50,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {16852#false} ~cond := #in~cond; {16852#false} is VALID [2022-04-15 12:29:50,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {16852#false} assume 0 == ~cond; {16852#false} is VALID [2022-04-15 12:29:50,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-15 12:29:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:29:50,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:30:41,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-15 12:30:41,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {17043#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16852#false} is VALID [2022-04-15 12:30:41,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {17047#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17043#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:41,768 INFO L272 TraceCheckUtils]: 44: Hoare triple {17051#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17047#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:30:41,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {17055#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {17051#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:30:41,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {17059#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17055#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {17063#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17059#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {17067#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17063#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {17071#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17067#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {17075#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17071#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {17079#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17075#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {17083#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17079#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {17087#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17083#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {17091#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17087#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:41,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {17095#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17091#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {17099#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17095#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {17103#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17099#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {17107#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17103#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {17111#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17107#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {17115#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17111#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {17119#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17115#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {17123#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17119#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {17127#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17123#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {17131#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17127#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {17135#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17131#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {17139#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17135#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {17143#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17139#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {17147#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17143#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {17151#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17147#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {17155#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17151#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {17159#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17155#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {17163#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17159#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {17167#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17163#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {17171#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17167#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {17175#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17171#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {17179#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17175#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {17183#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17179#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {17187#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17183#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {17191#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17187#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {17195#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17191#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {17199#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17195#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {17203#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17199#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {16851#true} ~x~0 := 268435441; {17203#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:30:42,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-15 12:30:42,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 12:30:42,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 12:30:42,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {16851#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(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 12:30:42,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16851#true} is VALID [2022-04-15 12:30:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:30:42,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678649747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:30:42,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:30:42,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 43] total 83 [2022-04-15 12:30:42,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:42,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013136593] [2022-04-15 12:30:42,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013136593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:42,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:42,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:30:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000799699] [2022-04-15 12:30:42,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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 48 [2022-04-15 12:30:42,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:42,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:30:42,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:42,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:30:42,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:42,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:30:42,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=5085, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 12:30:42,679 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:03,163 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 12:32:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:32:03,164 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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 48 [2022-04-15 12:32:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 12:32:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 12:32:03,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-15 12:32:03,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:03,398 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:32:03,399 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:32:03,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=3391, Invalid=11129, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 12:32:03,400 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:03,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 24.7s Time] [2022-04-15 12:32:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:32:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 12:32:03,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:03,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,450 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,450 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:03,450 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:32:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:32:03,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:03,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:03,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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 50 states. [2022-04-15 12:32:03,451 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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 50 states. [2022-04-15 12:32:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:03,451 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:32:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:32:03,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:03,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:03,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:03,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 12:32:03,452 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 12:32:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:03,453 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 12:32:03,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:03,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 12:32:03,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:32:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:32:03,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:03,823 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:03,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:04,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:04,042 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 75 times [2022-04-15 12:32:04,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181604941] [2022-04-15 12:32:04,076 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-15 12:32:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:04,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529448714] [2022-04-15 12:32:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:04,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:04,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 76 times [2022-04-15 12:32:04,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:04,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448923863] [2022-04-15 12:32:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:05,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {17654#(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(13, 2);call #Ultimate.allocInit(12, 3); {17610#true} is VALID [2022-04-15 12:32:05,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-15 12:32:05,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-15 12:32:05,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {17610#true} call ULTIMATE.init(); {17654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:05,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {17654#(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(13, 2);call #Ultimate.allocInit(12, 3); {17610#true} is VALID [2022-04-15 12:32:05,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-15 12:32:05,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-15 12:32:05,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-15 12:32:05,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {17610#true} ~x~0 := 268435441; {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:32:05,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:32:05,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:32:05,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:32:05,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:32:05,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:32:05,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:32:05,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:32:05,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:32:05,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:32:05,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:32:05,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:32:05,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:32:05,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:32:05,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:32:05,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:32:05,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:32:05,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:32:05,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:32:05,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:32:05,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:32:05,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:32:05,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:32:05,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:32:05,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:32:05,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:32:05,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:32:05,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:32:05,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:32:05,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:32:05,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:32:05,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:32:05,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:32:05,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:32:05,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:32:06,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 12:32:06,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 12:32:06,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 12:32:06,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17653#(and (<= (div main_~x~0 4294967296) 0) (<= 268435365 main_~x~0))} is VALID [2022-04-15 12:32:06,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {17653#(and (<= (div main_~x~0 4294967296) 0) (<= 268435365 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {17611#false} is VALID [2022-04-15 12:32:06,106 INFO L272 TraceCheckUtils]: 45: Hoare triple {17611#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17611#false} is VALID [2022-04-15 12:32:06,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-15 12:32:06,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-15 12:32:06,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-15 12:32:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448923863] [2022-04-15 12:32:06,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448923863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:06,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348875721] [2022-04-15 12:32:06,107 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:06,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:06,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:06,120 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:06,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 12:32:06,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:06,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:06,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 12:32:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:06,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:06,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {17610#true} call ULTIMATE.init(); {17610#true} is VALID [2022-04-15 12:32:06,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {17610#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(13, 2);call #Ultimate.allocInit(12, 3); {17610#true} is VALID [2022-04-15 12:32:06,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-15 12:32:06,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-15 12:32:06,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-15 12:32:06,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {17610#true} ~x~0 := 268435441; {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 12:32:06,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 12:32:06,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 12:32:06,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 12:32:06,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 12:32:06,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 12:32:06,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 12:32:06,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 12:32:06,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 12:32:06,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 12:32:07,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 12:32:07,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 12:32:07,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 12:32:07,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 12:32:07,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 12:32:07,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 12:32:07,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 12:32:07,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 12:32:07,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 12:32:07,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 12:32:07,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 12:32:07,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 12:32:07,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 12:32:07,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 12:32:07,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 12:32:07,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 12:32:07,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 12:32:07,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 12:32:07,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 12:32:07,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 12:32:07,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 12:32:07,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 12:32:07,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 12:32:07,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 12:32:07,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 12:32:07,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 12:32:08,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 12:32:08,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 12:32:08,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17787#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 12:32:08,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {17787#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !(~x~0 % 4294967296 > 1); {17611#false} is VALID [2022-04-15 12:32:08,123 INFO L272 TraceCheckUtils]: 45: Hoare triple {17611#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17611#false} is VALID [2022-04-15 12:32:08,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-15 12:32:08,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-15 12:32:08,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-15 12:32:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:08,124 INFO L328 TraceCheckSpWp]: Computing backward predicates...