/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/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:01:12,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:01:12,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:01:12,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:01:12,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:01:12,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:01:12,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:01:12,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:01:12,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:01:12,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:01:12,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:01:12,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:01:12,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:01:12,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:01:12,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:01:12,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:01:12,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:01:12,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:01:12,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:01:12,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:01:12,144 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:01:12,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:01:12,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:01:12,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:01:12,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:01:12,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:01:12,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:01:12,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:01:12,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:01:12,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:01:12,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:01:12,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:01:12,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:01:12,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:01:12,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:01:12,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:01:12,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:01:12,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:01:12,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:01:12,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:01:12,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:01:12,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:01:12,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:01:12,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:01:12,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:01:12,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:01:12,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:01:12,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:01:12,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:01:12,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:01:12,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:01:12,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:01:12,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:01:12,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:01:12,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:01:12,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:01:12,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:01:12,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:01:12,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:01:12,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:01:12,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:01:12,173 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:01:12,173 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:01:12,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:01:12,173 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:01:12,173 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:01:12,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:01:12,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:01:12,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:01:12,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:01:12,362 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:01:12,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2022-04-08 09:01:12,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4806e6df/b561c8c2980343d9b839f5c788af6c9d/FLAG9c3c0a97e [2022-04-08 09:01:12,758 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:01:12,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-08 09:01:12,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4806e6df/b561c8c2980343d9b839f5c788af6c9d/FLAG9c3c0a97e [2022-04-08 09:01:12,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4806e6df/b561c8c2980343d9b839f5c788af6c9d [2022-04-08 09:01:12,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:01:12,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:01:12,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:01:12,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:01:12,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:01:12,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:12,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422bc548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12, skipping insertion in model container [2022-04-08 09:01:12,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:12,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:01:12,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:01:12,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-08 09:01:12,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:01:12,930 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:01:12,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-08 09:01:12,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:01:12,972 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:01:12,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12 WrapperNode [2022-04-08 09:01:12,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:01:12,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:01:12,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:01:12,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:01:12,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:12,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:12,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:12,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:13,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:13,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:13,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:13,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:01:13,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:01:13,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:01:13,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:01:13,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (1/1) ... [2022-04-08 09:01:13,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:01:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:13,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:01:13,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:01:13,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:01:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:01:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:01:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:01:13,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:01:13,072 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:01:13,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:01:13,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:01:13,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:01:13,072 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:01:13,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:01:13,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:01:13,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:01:13,146 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:01:13,148 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:01:13,242 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:01:13,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:01:13,247 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:01:13,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:01:13 BoogieIcfgContainer [2022-04-08 09:01:13,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:01:13,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:01:13,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:01:13,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:01:13,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:01:12" (1/3) ... [2022-04-08 09:01:13,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540a7bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:01:13, skipping insertion in model container [2022-04-08 09:01:13,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:12" (2/3) ... [2022-04-08 09:01:13,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540a7bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:01:13, skipping insertion in model container [2022-04-08 09:01:13,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:01:13" (3/3) ... [2022-04-08 09:01:13,254 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2022-04-08 09:01:13,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:01:13,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:01:13,316 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:01:13,320 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:01:13,320 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:01:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:01:13,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:13,359 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:13,359 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 1 times [2022-04-08 09:01:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:13,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1349072428] [2022-04-08 09:01:13,400 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:01:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 2 times [2022-04-08 09:01:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:13,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619428494] [2022-04-08 09:01:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:13,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:13,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(10, 2); {23#true} is VALID [2022-04-08 09:01:13,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:01:13,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-08 09:01:13,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:13,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(10, 2); {23#true} is VALID [2022-04-08 09:01:13,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:01:13,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-08 09:01:13,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2022-04-08 09:01:13,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:13,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:13,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:01:13,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-08 09:01:13,740 INFO L272 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:13,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:01:13,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:01:13,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:01:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:13,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:13,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619428494] [2022-04-08 09:01:13,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619428494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:13,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:13,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:01:13,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:13,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1349072428] [2022-04-08 09:01:13,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1349072428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:13,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:13,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:01:13,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786900624] [2022-04-08 09:01:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:01:13,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:13,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:13,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:13,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:01:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:01:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:01:13,799 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:14,152 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2022-04-08 09:01:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:01:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:01:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 09:01:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 09:01:14,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-08 09:01:14,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:14,231 INFO L225 Difference]: With dead ends: 41 [2022-04-08 09:01:14,231 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 09:01:14,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:01:14,237 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:14,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 09:01:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-08 09:01:14,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:14,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:14,305 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:14,306 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:14,310 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-08 09:01:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 09:01:14,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:14,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:14,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 09:01:14,325 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 09:01:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:14,327 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-08 09:01:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 09:01:14,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:14,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:14,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:14,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-08 09:01:14,334 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-08 09:01:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:14,335 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-08 09:01:14,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:14,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-08 09:01:14,375 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-08 09:01:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-08 09:01:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:01:14,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:14,376 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:14,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:01:14,376 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 1 times [2022-04-08 09:01:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:14,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726210620] [2022-04-08 09:01:14,834 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:14,834 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 2 times [2022-04-08 09:01:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669807337] [2022-04-08 09:01:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:14,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#(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(10, 2); {232#true} is VALID [2022-04-08 09:01:14,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:14,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-08 09:01:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:14,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-08 09:01:14,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-08 09:01:14,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:14,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #46#return; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-08 09:01:14,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:14,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#(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(10, 2); {232#true} is VALID [2022-04-08 09:01:15,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:15,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-08 09:01:15,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-08 09:01:15,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:15,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:15,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:01:15,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-08 09:01:15,002 INFO L272 TraceCheckUtils]: 9: Hoare triple {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {232#true} is VALID [2022-04-08 09:01:15,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-08 09:01:15,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-08 09:01:15,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:15,004 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {232#true} {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #46#return; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-08 09:01:15,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume !false; {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-08 09:01:15,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {244#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} is VALID [2022-04-08 09:01:15,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {244#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {245#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-08 09:01:15,010 INFO L272 TraceCheckUtils]: 17: Hoare triple {245#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {246#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:15,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {246#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {247#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:01:15,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {247#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {233#false} is VALID [2022-04-08 09:01:15,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-08 09:01:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669807337] [2022-04-08 09:01:15,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669807337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014796553] [2022-04-08 09:01:15,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:15,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:15,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:15,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:15,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:01:15,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:15,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:15,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 09:01:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:15,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:15,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2022-04-08 09:01:15,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {232#true} is VALID [2022-04-08 09:01:15,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:15,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-08 09:01:15,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-08 09:01:15,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:15,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:15,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:01:15,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:01:15,345 INFO L272 TraceCheckUtils]: 9: Hoare triple {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {232#true} is VALID [2022-04-08 09:01:15,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-08 09:01:15,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-08 09:01:15,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:15,346 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {232#true} {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #46#return; {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:01:15,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !false; {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:01:15,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {298#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:01:15,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {298#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {302#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:01:15,349 INFO L272 TraceCheckUtils]: 17: Hoare triple {302#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:01:15,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:15,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {233#false} is VALID [2022-04-08 09:01:15,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-08 09:01:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:15,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:15,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-08 09:01:15,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {233#false} is VALID [2022-04-08 09:01:15,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:15,951 INFO L272 TraceCheckUtils]: 17: Hoare triple {326#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:01:15,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {330#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {326#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-08 09:01:15,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {330#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-08 09:01:15,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} assume !false; {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:01:15,955 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {232#true} {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} #46#return; {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:01:15,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:15,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-08 09:01:15,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-08 09:01:15,955 INFO L272 TraceCheckUtils]: 9: Hoare triple {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {232#true} is VALID [2022-04-08 09:01:15,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {334#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:01:15,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {356#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:01:15,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} assume !false; {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:01:15,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {360#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:01:15,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-08 09:01:15,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-08 09:01:15,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-08 09:01:15,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {232#true} is VALID [2022-04-08 09:01:15,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2022-04-08 09:01:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:15,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014796553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:15,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:15,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-08 09:01:15,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:15,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726210620] [2022-04-08 09:01:15,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726210620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:15,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:15,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:01:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319198428] [2022-04-08 09:01:15,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:15,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 09:01:15,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:15,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:15,981 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-08 09:01:15,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:01:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:01:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:01:15,982 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:16,254 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-08 09:01:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:01:16,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 09:01:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 09:01:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 09:01:16,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-08 09:01:16,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:16,285 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:01:16,286 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 09:01:16,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:01:16,287 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:16,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 33 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 09:01:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-04-08 09:01:16,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:16,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:16,308 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:16,308 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:16,309 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 09:01:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 09:01:16,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:16,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:16,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 09:01:16,310 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 09:01:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:16,312 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 09:01:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 09:01:16,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:16,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:16,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:16,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-08 09:01:16,314 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2022-04-08 09:01:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:16,314 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-08 09:01:16,314 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:16,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-08 09:01:16,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 09:01:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:01:16,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:16,370 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:16,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:01:16,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:16,583 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1109836175, now seen corresponding path program 1 times [2022-04-08 09:01:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:16,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521912678] [2022-04-08 09:01:16,960 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:16,960 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1109836175, now seen corresponding path program 2 times [2022-04-08 09:01:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654635033] [2022-04-08 09:01:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:17,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#(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(10, 2); {586#true} is VALID [2022-04-08 09:01:17,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-08 09:01:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:17,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-08 09:01:17,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-08 09:01:17,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:17,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:17,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#(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(10, 2); {586#true} is VALID [2022-04-08 09:01:17,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-08 09:01:17,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret4 := main(); {586#true} is VALID [2022-04-08 09:01:17,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {591#(= main_~x~0 0)} is VALID [2022-04-08 09:01:17,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#(= main_~x~0 0)} assume !false; {591#(= main_~x~0 0)} is VALID [2022-04-08 09:01:17,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {591#(= main_~x~0 0)} is VALID [2022-04-08 09:01:17,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:17,077 INFO L272 TraceCheckUtils]: 9: Hoare triple {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {586#true} is VALID [2022-04-08 09:01:17,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-08 09:01:17,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-08 09:01:17,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,078 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {586#true} {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:17,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:17,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {592#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {587#false} is VALID [2022-04-08 09:01:17,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {587#false} is VALID [2022-04-08 09:01:17,083 INFO L272 TraceCheckUtils]: 17: Hoare triple {587#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {587#false} is VALID [2022-04-08 09:01:17,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} ~cond := #in~cond; {587#false} is VALID [2022-04-08 09:01:17,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#false} assume 0 == ~cond; {587#false} is VALID [2022-04-08 09:01:17,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-04-08 09:01:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654635033] [2022-04-08 09:01:17,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654635033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:17,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634201032] [2022-04-08 09:01:17,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:17,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:17,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:17,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:01:17,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:17,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:17,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:01:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:17,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:17,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {586#true} is VALID [2022-04-08 09:01:17,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {586#true} is VALID [2022-04-08 09:01:17,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-08 09:01:17,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret4 := main(); {586#true} is VALID [2022-04-08 09:01:17,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {591#(= main_~x~0 0)} is VALID [2022-04-08 09:01:17,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#(= main_~x~0 0)} assume !false; {591#(= main_~x~0 0)} is VALID [2022-04-08 09:01:17,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {591#(= main_~x~0 0)} is VALID [2022-04-08 09:01:17,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {625#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-08 09:01:17,200 INFO L272 TraceCheckUtils]: 9: Hoare triple {625#(= (+ (- 1) main_~x~0) 0)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {586#true} is VALID [2022-04-08 09:01:17,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-08 09:01:17,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-08 09:01:17,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,201 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {586#true} {625#(= (+ (- 1) main_~x~0) 0)} #46#return; {625#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-08 09:01:17,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(= (+ (- 1) main_~x~0) 0)} assume !false; {625#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-08 09:01:17,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {625#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 10); {587#false} is VALID [2022-04-08 09:01:17,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {587#false} is VALID [2022-04-08 09:01:17,202 INFO L272 TraceCheckUtils]: 17: Hoare triple {587#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {587#false} is VALID [2022-04-08 09:01:17,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} ~cond := #in~cond; {587#false} is VALID [2022-04-08 09:01:17,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#false} assume 0 == ~cond; {587#false} is VALID [2022-04-08 09:01:17,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-04-08 09:01:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:17,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:17,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-04-08 09:01:17,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#false} assume 0 == ~cond; {587#false} is VALID [2022-04-08 09:01:17,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} ~cond := #in~cond; {587#false} is VALID [2022-04-08 09:01:17,283 INFO L272 TraceCheckUtils]: 17: Hoare triple {587#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {587#false} is VALID [2022-04-08 09:01:17,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {587#false} is VALID [2022-04-08 09:01:17,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {677#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {587#false} is VALID [2022-04-08 09:01:17,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#(< (mod main_~x~0 4294967296) 10)} assume !false; {677#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:17,285 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {586#true} {677#(< (mod main_~x~0 4294967296) 10)} #46#return; {677#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:17,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {586#true} assume !(0 == ~cond); {586#true} is VALID [2022-04-08 09:01:17,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#true} ~cond := #in~cond; {586#true} is VALID [2022-04-08 09:01:17,285 INFO L272 TraceCheckUtils]: 9: Hoare triple {677#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {586#true} is VALID [2022-04-08 09:01:17,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {677#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:17,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:17,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:17,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {699#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:17,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} call #t~ret4 := main(); {586#true} is VALID [2022-04-08 09:01:17,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} #48#return; {586#true} is VALID [2022-04-08 09:01:17,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume true; {586#true} is VALID [2022-04-08 09:01:17,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {586#true} is VALID [2022-04-08 09:01:17,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {586#true} is VALID [2022-04-08 09:01:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634201032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:17,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:17,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 09:01:17,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:17,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521912678] [2022-04-08 09:01:17,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521912678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:17,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:17,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:01:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960962634] [2022-04-08 09:01:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 09:01:17,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:17,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:17,304 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-08 09:01:17,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:01:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:01:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:01:17,305 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:17,423 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-08 09:01:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:01:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 09:01:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 09:01:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 09:01:17,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-08 09:01:17,454 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-08 09:01:17,455 INFO L225 Difference]: With dead ends: 41 [2022-04-08 09:01:17,455 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 09:01:17,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:01:17,456 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:17,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 09:01:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-08 09:01:17,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:17,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:17,489 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:17,489 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:17,491 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 09:01:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 09:01:17,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:17,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:17,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 09:01:17,492 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 09:01:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:17,493 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 09:01:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 09:01:17,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:17,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:17,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:17,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-08 09:01:17,495 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2022-04-08 09:01:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:17,496 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-08 09:01:17,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:01:17,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-08 09:01:17,527 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-08 09:01:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-08 09:01:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 09:01:17,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:17,528 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:17,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:01:17,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 09:01:17,747 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:17,748 INFO L85 PathProgramCache]: Analyzing trace with hash 723660460, now seen corresponding path program 3 times [2022-04-08 09:01:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:17,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [24030023] [2022-04-08 09:01:17,998 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:17,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 723660460, now seen corresponding path program 4 times [2022-04-08 09:01:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:17,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93865796] [2022-04-08 09:01:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#(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(10, 2); {934#true} is VALID [2022-04-08 09:01:18,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-08 09:01:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} #46#return; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:18,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:18,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#(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(10, 2); {934#true} is VALID [2022-04-08 09:01:18,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-08 09:01:18,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret4 := main(); {934#true} is VALID [2022-04-08 09:01:18,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {939#(= main_~x~0 0)} is VALID [2022-04-08 09:01:18,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#(= main_~x~0 0)} assume !false; {939#(= main_~x~0 0)} is VALID [2022-04-08 09:01:18,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {939#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {939#(= main_~x~0 0)} is VALID [2022-04-08 09:01:18,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,121 INFO L272 TraceCheckUtils]: 9: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-08 09:01:18,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,122 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {934#true} {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:18,124 INFO L272 TraceCheckUtils]: 17: Hoare triple {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-08 09:01:18,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,125 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {934#true} {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} #46#return; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:18,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !false; {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:18,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {945#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10); {935#false} is VALID [2022-04-08 09:01:18,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {935#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {935#false} is VALID [2022-04-08 09:01:18,126 INFO L272 TraceCheckUtils]: 25: Hoare triple {935#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {935#false} is VALID [2022-04-08 09:01:18,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {935#false} ~cond := #in~cond; {935#false} is VALID [2022-04-08 09:01:18,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {935#false} assume 0 == ~cond; {935#false} is VALID [2022-04-08 09:01:18,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {935#false} assume !false; {935#false} is VALID [2022-04-08 09:01:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:01:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:18,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93865796] [2022-04-08 09:01:18,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93865796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:18,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528058424] [2022-04-08 09:01:18,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:18,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:18,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:18,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:01:18,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:18,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:18,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 09:01:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:18,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {934#true} is VALID [2022-04-08 09:01:18,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {934#true} is VALID [2022-04-08 09:01:18,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-08 09:01:18,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret4 := main(); {934#true} is VALID [2022-04-08 09:01:18,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {969#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:18,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {969#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {969#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-08 09:01:18,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {939#(= main_~x~0 0)} is VALID [2022-04-08 09:01:18,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,416 INFO L272 TraceCheckUtils]: 9: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-08 09:01:18,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,417 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {934#true} {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:18,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:18,418 INFO L272 TraceCheckUtils]: 17: Hoare triple {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-08 09:01:18,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,419 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {934#true} {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:18,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:18,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {1003#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10); {935#false} is VALID [2022-04-08 09:01:18,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {935#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {935#false} is VALID [2022-04-08 09:01:18,420 INFO L272 TraceCheckUtils]: 25: Hoare triple {935#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {935#false} is VALID [2022-04-08 09:01:18,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {935#false} ~cond := #in~cond; {935#false} is VALID [2022-04-08 09:01:18,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {935#false} assume 0 == ~cond; {935#false} is VALID [2022-04-08 09:01:18,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {935#false} assume !false; {935#false} is VALID [2022-04-08 09:01:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:01:18,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:18,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {935#false} assume !false; {935#false} is VALID [2022-04-08 09:01:18,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {935#false} assume 0 == ~cond; {935#false} is VALID [2022-04-08 09:01:18,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {935#false} ~cond := #in~cond; {935#false} is VALID [2022-04-08 09:01:18,543 INFO L272 TraceCheckUtils]: 25: Hoare triple {935#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {935#false} is VALID [2022-04-08 09:01:18,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {935#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {935#false} is VALID [2022-04-08 09:01:18,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {1055#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {935#false} is VALID [2022-04-08 09:01:18,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {1055#(< (mod main_~x~0 4294967296) 10)} assume !false; {1055#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:18,544 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {934#true} {1055#(< (mod main_~x~0 4294967296) 10)} #46#return; {1055#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:18,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,544 INFO L272 TraceCheckUtils]: 17: Hoare triple {1055#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-08 09:01:18,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1055#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:18,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:18,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:18,546 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {934#true} {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:18,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#true} assume !(0 == ~cond); {934#true} is VALID [2022-04-08 09:01:18,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {934#true} ~cond := #in~cond; {934#true} is VALID [2022-04-08 09:01:18,547 INFO L272 TraceCheckUtils]: 9: Hoare triple {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {934#true} is VALID [2022-04-08 09:01:18,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1077#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:18,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:18,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:18,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1102#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:18,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret4 := main(); {934#true} is VALID [2022-04-08 09:01:18,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #48#return; {934#true} is VALID [2022-04-08 09:01:18,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-08 09:01:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {934#true} is VALID [2022-04-08 09:01:18,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {934#true} is VALID [2022-04-08 09:01:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:01:18,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528058424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:18,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:18,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 11 [2022-04-08 09:01:18,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [24030023] [2022-04-08 09:01:18,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [24030023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:18,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:18,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:01:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134289436] [2022-04-08 09:01:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-08 09:01:18,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:18,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:18,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:18,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:01:18,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:18,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:01:18,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:01:18,574 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:18,737 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 09:01:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:01:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-08 09:01:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 09:01:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 09:01:18,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-08 09:01:18,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:18,774 INFO L225 Difference]: With dead ends: 45 [2022-04-08 09:01:18,775 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 09:01:18,775 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:01:18,775 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:18,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 22 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 09:01:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 09:01:18,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:18,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:18,821 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:18,821 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:18,823 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 09:01:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 09:01:18,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:18,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:18,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-08 09:01:18,823 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-08 09:01:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:18,825 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 09:01:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 09:01:18,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:18,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:18,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:18,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 09:01:18,826 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-04-08 09:01:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:18,827 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 09:01:18,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:01:18,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 09:01:18,861 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-08 09:01:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 09:01:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 09:01:18,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:18,861 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:18,884 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-08 09:01:19,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:19,075 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash -668913975, now seen corresponding path program 5 times [2022-04-08 09:01:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:19,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189539591] [2022-04-08 09:01:19,315 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:19,315 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash -668913975, now seen corresponding path program 6 times [2022-04-08 09:01:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:19,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824265196] [2022-04-08 09:01:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:19,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {1384#(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(10, 2); {1363#true} is VALID [2022-04-08 09:01:19,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1363#true} {1363#true} #48#return; {1363#true} is VALID [2022-04-08 09:01:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:19,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-08 09:01:19,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-08 09:01:19,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:19,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-08 09:01:19,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-08 09:01:19,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:01:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:19,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-08 09:01:19,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-08 09:01:19,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} #46#return; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-08 09:01:19,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {1363#true} call ULTIMATE.init(); {1384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:19,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#(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(10, 2); {1363#true} is VALID [2022-04-08 09:01:19,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1363#true} #48#return; {1363#true} is VALID [2022-04-08 09:01:19,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {1363#true} call #t~ret4 := main(); {1363#true} is VALID [2022-04-08 09:01:19,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1368#(= main_~x~0 0)} is VALID [2022-04-08 09:01:19,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {1368#(= main_~x~0 0)} assume !false; {1368#(= main_~x~0 0)} is VALID [2022-04-08 09:01:19,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {1368#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1368#(= main_~x~0 0)} is VALID [2022-04-08 09:01:19,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {1368#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:19,444 INFO L272 TraceCheckUtils]: 9: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-08 09:01:19,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-08 09:01:19,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-08 09:01:19,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,445 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1363#true} {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:19,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:19,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:19,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:19,446 INFO L272 TraceCheckUtils]: 17: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-08 09:01:19,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-08 09:01:19,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-08 09:01:19,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,446 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1363#true} {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:19,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:19,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:19,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {1374#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-08 09:01:19,448 INFO L272 TraceCheckUtils]: 25: Hoare triple {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-08 09:01:19,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-08 09:01:19,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-08 09:01:19,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:19,451 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1363#true} {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} #46#return; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-08 09:01:19,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !false; {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-08 09:01:19,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {1379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10); {1364#false} is VALID [2022-04-08 09:01:19,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {1364#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1364#false} is VALID [2022-04-08 09:01:19,452 INFO L272 TraceCheckUtils]: 33: Hoare triple {1364#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1364#false} is VALID [2022-04-08 09:01:19,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {1364#false} ~cond := #in~cond; {1364#false} is VALID [2022-04-08 09:01:19,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {1364#false} assume 0 == ~cond; {1364#false} is VALID [2022-04-08 09:01:19,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2022-04-08 09:01:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 09:01:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:19,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824265196] [2022-04-08 09:01:19,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824265196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:19,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078700481] [2022-04-08 09:01:19,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:01:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:19,475 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:19,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 09:01:19,635 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:01:19,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:19,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 09:01:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:19,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:21,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {1363#true} call ULTIMATE.init(); {1363#true} is VALID [2022-04-08 09:01:21,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1363#true} is VALID [2022-04-08 09:01:21,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:21,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1363#true} #48#return; {1363#true} is VALID [2022-04-08 09:01:21,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {1363#true} call #t~ret4 := main(); {1363#true} is VALID [2022-04-08 09:01:21,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1368#(= main_~x~0 0)} is VALID [2022-04-08 09:01:21,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {1368#(= main_~x~0 0)} assume !false; {1368#(= main_~x~0 0)} is VALID [2022-04-08 09:01:21,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {1368#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1368#(= main_~x~0 0)} is VALID [2022-04-08 09:01:21,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {1368#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:21,320 INFO L272 TraceCheckUtils]: 9: Hoare triple {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-08 09:01:21,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {1363#true} ~cond := #in~cond; {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:21,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:21,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:21,322 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} {1369#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} is VALID [2022-04-08 09:01:21,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} assume !false; {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} is VALID [2022-04-08 09:01:21,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {1429#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-08 09:01:21,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-08 09:01:21,326 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-08 09:01:21,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {1363#true} ~cond := #in~cond; {1363#true} is VALID [2022-04-08 09:01:21,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {1363#true} assume !(0 == ~cond); {1363#true} is VALID [2022-04-08 09:01:21,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#true} assume true; {1363#true} is VALID [2022-04-08 09:01:21,327 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1363#true} {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} #46#return; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-08 09:01:21,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} assume !false; {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} is VALID [2022-04-08 09:01:21,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#(exists ((main_~x~0 Int)) (and (<= 1 main_~x~0) (<= main_~x~0 1) (or (= (mod (+ 4294967294 main_~sn~0) 4294967296) (mod (* main_~x~0 2) 4294967296)) (= (+ (- 2) main_~sn~0) 0))))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1461#(and (< (mod main_~x~0 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-08 09:01:21,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {1461#(and (< (mod main_~x~0 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1465#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-08 09:01:21,330 INFO L272 TraceCheckUtils]: 25: Hoare triple {1465#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1363#true} is VALID [2022-04-08 09:01:21,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#true} ~cond := #in~cond; {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:21,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {1418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:21,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:21,333 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1422#(not (= |__VERIFIER_assert_#in~cond| 0))} {1465#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= (+ (- 4) main_~sn~0) 0)) (<= v_main_~x~0_40 1))))} #46#return; {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-08 09:01:21,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} assume !false; {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} is VALID [2022-04-08 09:01:21,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {1481#(and (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_main_~x~0_40 Int)) (and (<= 1 v_main_~x~0_40) (or (= (mod (+ 4294967292 main_~sn~0) 4294967296) (mod (* v_main_~x~0_40 2) 4294967296)) (= main_~sn~0 4)) (<= v_main_~x~0_40 1))))} assume !(~x~0 % 4294967296 < 10); {1364#false} is VALID [2022-04-08 09:01:21,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {1364#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1364#false} is VALID [2022-04-08 09:01:21,360 INFO L272 TraceCheckUtils]: 33: Hoare triple {1364#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1364#false} is VALID [2022-04-08 09:01:21,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {1364#false} ~cond := #in~cond; {1364#false} is VALID [2022-04-08 09:01:21,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {1364#false} assume 0 == ~cond; {1364#false} is VALID [2022-04-08 09:01:21,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2022-04-08 09:01:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 09:01:21,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:22,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078700481] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:22,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:01:22,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2022-04-08 09:01:22,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:22,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189539591] [2022-04-08 09:01:22,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189539591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:22,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:22,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:01:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753803851] [2022-04-08 09:01:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:22,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-04-08 09:01:22,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:22,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:22,814 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-08 09:01:22,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:01:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:22,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:01:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:01:22,815 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:23,109 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-08 09:01:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:01:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-04-08 09:01:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 09:01:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 09:01:23,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-08 09:01:23,146 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-08 09:01:23,147 INFO L225 Difference]: With dead ends: 49 [2022-04-08 09:01:23,147 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 09:01:23,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:01:23,148 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:23,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 09:01:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-08 09:01:23,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:23,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:23,213 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:23,213 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:23,214 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-08 09:01:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-08 09:01:23,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:23,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:23,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-04-08 09:01:23,215 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-04-08 09:01:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:23,216 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-08 09:01:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-08 09:01:23,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:23,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:23,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:23,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-04-08 09:01:23,218 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 37 [2022-04-08 09:01:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:23,218 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-04-08 09:01:23,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:01:23,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2022-04-08 09:01:23,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-08 09:01:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 09:01:23,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:23,267 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:23,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 09:01:23,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:23,468 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -505363994, now seen corresponding path program 7 times [2022-04-08 09:01:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:23,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415411675] [2022-04-08 09:01:23,685 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:23,685 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash -505363994, now seen corresponding path program 8 times [2022-04-08 09:01:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:23,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016221763] [2022-04-08 09:01:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {1844#(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(10, 2); {1818#true} is VALID [2022-04-08 09:01:23,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-08 09:01:23,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:23,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:01:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:01:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:23,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:23,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {1844#(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(10, 2); {1818#true} is VALID [2022-04-08 09:01:23,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-08 09:01:23,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret4 := main(); {1818#true} is VALID [2022-04-08 09:01:23,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1823#(= main_~x~0 0)} is VALID [2022-04-08 09:01:23,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {1823#(= main_~x~0 0)} assume !false; {1823#(= main_~x~0 0)} is VALID [2022-04-08 09:01:23,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {1823#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1823#(= main_~x~0 0)} is VALID [2022-04-08 09:01:23,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1823#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:23,818 INFO L272 TraceCheckUtils]: 9: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:23,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,818 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1818#true} {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:23,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:23,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:23,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:23,820 INFO L272 TraceCheckUtils]: 17: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:23,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,820 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:23,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:23,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:23,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:23,822 INFO L272 TraceCheckUtils]: 25: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:23,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,823 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1818#true} {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:23,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:23,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:23,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:23,825 INFO L272 TraceCheckUtils]: 33: Hoare triple {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:23,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:23,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:23,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:23,825 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:23,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:23,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {1839#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {1819#false} is VALID [2022-04-08 09:01:23,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1819#false} is VALID [2022-04-08 09:01:23,826 INFO L272 TraceCheckUtils]: 41: Hoare triple {1819#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1819#false} is VALID [2022-04-08 09:01:23,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#false} ~cond := #in~cond; {1819#false} is VALID [2022-04-08 09:01:23,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#false} assume 0 == ~cond; {1819#false} is VALID [2022-04-08 09:01:23,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-08 09:01:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 09:01:23,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:23,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016221763] [2022-04-08 09:01:23,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016221763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:23,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800592514] [2022-04-08 09:01:23,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:23,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:23,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:23,844 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:01:23,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 09:01:23,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:23,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:23,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 09:01:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:23,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:24,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2022-04-08 09:01:24,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1818#true} is VALID [2022-04-08 09:01:24,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-08 09:01:24,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret4 := main(); {1818#true} is VALID [2022-04-08 09:01:24,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1823#(= main_~x~0 0)} is VALID [2022-04-08 09:01:24,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {1823#(= main_~x~0 0)} assume !false; {1823#(= main_~x~0 0)} is VALID [2022-04-08 09:01:24,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {1823#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1823#(= main_~x~0 0)} is VALID [2022-04-08 09:01:24,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {1823#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:24,233 INFO L272 TraceCheckUtils]: 9: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,234 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1818#true} {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:24,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:24,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:24,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {1824#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:24,235 INFO L272 TraceCheckUtils]: 17: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,236 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:24,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:24,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:24,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {1829#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:24,237 INFO L272 TraceCheckUtils]: 25: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,238 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1818#true} {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:24,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:24,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:24,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {1834#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:24,239 INFO L272 TraceCheckUtils]: 33: Hoare triple {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,240 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:24,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:24,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {1819#false} is VALID [2022-04-08 09:01:24,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1819#false} is VALID [2022-04-08 09:01:24,241 INFO L272 TraceCheckUtils]: 41: Hoare triple {1819#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1819#false} is VALID [2022-04-08 09:01:24,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#false} ~cond := #in~cond; {1819#false} is VALID [2022-04-08 09:01:24,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#false} assume 0 == ~cond; {1819#false} is VALID [2022-04-08 09:01:24,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-08 09:01:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 09:01:24,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:24,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-08 09:01:24,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {1819#false} assume 0 == ~cond; {1819#false} is VALID [2022-04-08 09:01:24,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {1819#false} ~cond := #in~cond; {1819#false} is VALID [2022-04-08 09:01:24,427 INFO L272 TraceCheckUtils]: 41: Hoare triple {1819#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1819#false} is VALID [2022-04-08 09:01:24,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {1819#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1819#false} is VALID [2022-04-08 09:01:24,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {1996#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {1819#false} is VALID [2022-04-08 09:01:24,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {1996#(< (mod main_~x~0 4294967296) 10)} assume !false; {1996#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:24,428 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1996#(< (mod main_~x~0 4294967296) 10)} #46#return; {1996#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:24,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,428 INFO L272 TraceCheckUtils]: 33: Hoare triple {1996#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1996#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:24,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:24,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:24,433 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1818#true} {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:24,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,433 INFO L272 TraceCheckUtils]: 25: Hoare triple {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2018#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:24,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:24,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:24,435 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:24,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,435 INFO L272 TraceCheckUtils]: 17: Hoare triple {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2043#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:24,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:24,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:24,437 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1818#true} {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:24,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 09:01:24,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 09:01:24,438 INFO L272 TraceCheckUtils]: 9: Hoare triple {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 09:01:24,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2068#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:24,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:24,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:24,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2093#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:24,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret4 := main(); {1818#true} is VALID [2022-04-08 09:01:24,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #48#return; {1818#true} is VALID [2022-04-08 09:01:24,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 09:01:24,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1818#true} is VALID [2022-04-08 09:01:24,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2022-04-08 09:01:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 09:01:24,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800592514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:24,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:24,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 09:01:24,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:24,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415411675] [2022-04-08 09:01:24,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415411675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:24,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:24,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:01:24,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430501005] [2022-04-08 09:01:24,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:24,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-08 09:01:24,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:24,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:24,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:24,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:01:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:24,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:01:24,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:01:24,478 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:24,842 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 09:01:24,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:01:24,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-08 09:01:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 09:01:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 09:01:24,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-08 09:01:24,873 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-08 09:01:24,874 INFO L225 Difference]: With dead ends: 53 [2022-04-08 09:01:24,874 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 09:01:24,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:01:24,875 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:24,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 09:01:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-08 09:01:24,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:24,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:24,966 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:24,968 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:24,972 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 09:01:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 09:01:24,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:24,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:24,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-08 09:01:24,973 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-08 09:01:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:24,974 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 09:01:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 09:01:24,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:24,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:24,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:24,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-04-08 09:01:24,976 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 45 [2022-04-08 09:01:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:24,976 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-04-08 09:01:24,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 09:01:24,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 48 transitions. [2022-04-08 09:01:25,031 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-08 09:01:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 09:01:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 09:01:25,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:25,032 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:25,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 09:01:25,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:25,247 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash -736237565, now seen corresponding path program 9 times [2022-04-08 09:01:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:25,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979568141] [2022-04-08 09:01:25,467 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:25,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash -736237565, now seen corresponding path program 10 times [2022-04-08 09:01:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568167548] [2022-04-08 09:01:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#(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(10, 2); {2406#true} is VALID [2022-04-08 09:01:25,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-08 09:01:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:01:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:01:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-08 09:01:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} #46#return; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:25,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:25,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#(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(10, 2); {2406#true} is VALID [2022-04-08 09:01:25,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-08 09:01:25,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret4 := main(); {2406#true} is VALID [2022-04-08 09:01:25,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2411#(= main_~x~0 0)} is VALID [2022-04-08 09:01:25,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {2411#(= main_~x~0 0)} assume !false; {2411#(= main_~x~0 0)} is VALID [2022-04-08 09:01:25,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {2411#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2411#(= main_~x~0 0)} is VALID [2022-04-08 09:01:25,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {2411#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,615 INFO L272 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,616 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2406#true} {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,617 INFO L272 TraceCheckUtils]: 17: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,617 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2406#true} {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,619 INFO L272 TraceCheckUtils]: 25: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,619 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2406#true} {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,620 INFO L272 TraceCheckUtils]: 33: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,621 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2406#true} {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:25,622 INFO L272 TraceCheckUtils]: 41: Hoare triple {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,623 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2406#true} {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} #46#return; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:25,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !false; {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:25,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {2432#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {2407#false} is VALID [2022-04-08 09:01:25,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {2407#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-08 09:01:25,624 INFO L272 TraceCheckUtils]: 49: Hoare triple {2407#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2407#false} is VALID [2022-04-08 09:01:25,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-08 09:01:25,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-08 09:01:25,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-08 09:01:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 09:01:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568167548] [2022-04-08 09:01:25,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568167548] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363887769] [2022-04-08 09:01:25,625 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:25,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:25,635 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-08 09:01:25,636 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-08 09:01:25,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:25,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:25,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 09:01:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:25,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:25,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-08 09:01:25,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-08 09:01:25,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-08 09:01:25,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret4 := main(); {2406#true} is VALID [2022-04-08 09:01:25,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2411#(= main_~x~0 0)} is VALID [2022-04-08 09:01:25,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {2411#(= main_~x~0 0)} assume !false; {2411#(= main_~x~0 0)} is VALID [2022-04-08 09:01:25,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {2411#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2411#(= main_~x~0 0)} is VALID [2022-04-08 09:01:25,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {2411#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,972 INFO L272 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,973 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2406#true} {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:25,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {2412#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,974 INFO L272 TraceCheckUtils]: 17: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,974 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2406#true} {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:25,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {2417#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,975 INFO L272 TraceCheckUtils]: 25: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,976 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2406#true} {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:25,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {2422#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,977 INFO L272 TraceCheckUtils]: 33: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,977 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2406#true} {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:25,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {2427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:25,978 INFO L272 TraceCheckUtils]: 41: Hoare triple {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:25,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:25,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:25,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:25,979 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2406#true} {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:25,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:25,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {2561#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {2407#false} is VALID [2022-04-08 09:01:25,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {2407#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-08 09:01:25,980 INFO L272 TraceCheckUtils]: 49: Hoare triple {2407#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2407#false} is VALID [2022-04-08 09:01:25,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-08 09:01:25,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-08 09:01:25,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-08 09:01:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 09:01:25,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:26,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-08 09:01:26,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-08 09:01:26,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-08 09:01:26,165 INFO L272 TraceCheckUtils]: 49: Hoare triple {2407#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2407#false} is VALID [2022-04-08 09:01:26,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {2407#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-08 09:01:26,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {2613#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {2407#false} is VALID [2022-04-08 09:01:26,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {2613#(< (mod main_~x~0 4294967296) 10)} assume !false; {2613#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:26,166 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2406#true} {2613#(< (mod main_~x~0 4294967296) 10)} #46#return; {2613#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:26,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:26,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:26,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:26,167 INFO L272 TraceCheckUtils]: 41: Hoare triple {2613#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:26,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2613#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:26,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:26,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:26,168 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2406#true} {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:26,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:26,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:26,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:26,168 INFO L272 TraceCheckUtils]: 33: Hoare triple {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:26,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2635#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:26,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:26,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:26,170 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2406#true} {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:26,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:26,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:26,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:26,170 INFO L272 TraceCheckUtils]: 25: Hoare triple {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:26,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2660#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:26,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:26,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:26,171 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2406#true} {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:26,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:26,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:26,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:26,172 INFO L272 TraceCheckUtils]: 17: Hoare triple {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:26,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2685#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:26,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:26,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:26,173 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2406#true} {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:26,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:26,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} assume !(0 == ~cond); {2406#true} is VALID [2022-04-08 09:01:26,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} ~cond := #in~cond; {2406#true} is VALID [2022-04-08 09:01:26,173 INFO L272 TraceCheckUtils]: 9: Hoare triple {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2406#true} is VALID [2022-04-08 09:01:26,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {2710#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:26,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:26,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:26,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {2735#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:26,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret4 := main(); {2406#true} is VALID [2022-04-08 09:01:26,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #48#return; {2406#true} is VALID [2022-04-08 09:01:26,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-08 09:01:26,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-08 09:01:26,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-08 09:01:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 09:01:26,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363887769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:26,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:26,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 09:01:26,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:26,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979568141] [2022-04-08 09:01:26,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979568141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:26,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:26,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:01:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480505596] [2022-04-08 09:01:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-04-08 09:01:26,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:26,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:26,194 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-08 09:01:26,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:01:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:01:26,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:01:26,195 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:26,649 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 09:01:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:01:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-04-08 09:01:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 09:01:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 09:01:26,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-08 09:01:26,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:26,711 INFO L225 Difference]: With dead ends: 57 [2022-04-08 09:01:26,711 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 09:01:26,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:01:26,712 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:26,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 53 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 09:01:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-08 09:01:26,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:26,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:26,809 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:26,809 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:26,811 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 09:01:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 09:01:26,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:26,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:26,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-08 09:01:26,811 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-08 09:01:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:26,812 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 09:01:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 09:01:26,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:26,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:26,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:26,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-04-08 09:01:26,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 53 [2022-04-08 09:01:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:26,814 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-04-08 09:01:26,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 09:01:26,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 53 transitions. [2022-04-08 09:01:26,897 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-08 09:01:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-08 09:01:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 09:01:26,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:26,898 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:26,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 09:01:27,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:27,103 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 764780832, now seen corresponding path program 11 times [2022-04-08 09:01:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095133096] [2022-04-08 09:01:27,303 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:27,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash 764780832, now seen corresponding path program 12 times [2022-04-08 09:01:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:27,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448461737] [2022-04-08 09:01:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {3110#(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(10, 2); {3074#true} is VALID [2022-04-08 09:01:27,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3074#true} {3074#true} #48#return; {3074#true} is VALID [2022-04-08 09:01:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:27,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:27,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:01:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:01:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-08 09:01:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:27,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-08 09:01:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:27,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} #46#return; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:27,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:27,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {3110#(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(10, 2); {3074#true} is VALID [2022-04-08 09:01:27,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #48#return; {3074#true} is VALID [2022-04-08 09:01:27,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2022-04-08 09:01:27,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {3074#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3079#(= main_~x~0 0)} is VALID [2022-04-08 09:01:27,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {3079#(= main_~x~0 0)} assume !false; {3079#(= main_~x~0 0)} is VALID [2022-04-08 09:01:27,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {3079#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3079#(= main_~x~0 0)} is VALID [2022-04-08 09:01:27,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {3079#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:27,494 INFO L272 TraceCheckUtils]: 9: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:27,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,495 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3074#true} {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:27,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:27,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:27,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {3080#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:27,496 INFO L272 TraceCheckUtils]: 17: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:27,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,496 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3074#true} {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:27,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:27,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:27,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {3085#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:27,497 INFO L272 TraceCheckUtils]: 25: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:27,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,498 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3074#true} {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:27,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:27,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:27,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {3090#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:27,499 INFO L272 TraceCheckUtils]: 33: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:27,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,499 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3074#true} {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:27,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:27,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:27,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {3095#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:27,501 INFO L272 TraceCheckUtils]: 41: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:27,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,501 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3074#true} {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:27,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:27,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:27,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {3100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:27,503 INFO L272 TraceCheckUtils]: 49: Hoare triple {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:27,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:27,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:27,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:27,503 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3074#true} {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} #46#return; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:27,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !false; {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:27,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {3105#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 10); {3075#false} is VALID [2022-04-08 09:01:27,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {3075#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3075#false} is VALID [2022-04-08 09:01:27,504 INFO L272 TraceCheckUtils]: 57: Hoare triple {3075#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3075#false} is VALID [2022-04-08 09:01:27,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2022-04-08 09:01:27,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {3075#false} assume 0 == ~cond; {3075#false} is VALID [2022-04-08 09:01:27,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2022-04-08 09:01:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 09:01:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448461737] [2022-04-08 09:01:27,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448461737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749590037] [2022-04-08 09:01:27,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:01:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:27,506 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-08 09:01:27,543 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-08 09:01:28,579 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 09:01:28,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:28,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 09:01:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:28,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:29,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3074#true} is VALID [2022-04-08 09:01:29,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {3074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3074#true} is VALID [2022-04-08 09:01:29,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:29,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #48#return; {3074#true} is VALID [2022-04-08 09:01:29,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2022-04-08 09:01:29,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {3074#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3129#(= main_~sn~0 0)} is VALID [2022-04-08 09:01:29,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#(= main_~sn~0 0)} assume !false; {3129#(= main_~sn~0 0)} is VALID [2022-04-08 09:01:29,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#(= main_~sn~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3136#(= 2 main_~sn~0)} is VALID [2022-04-08 09:01:29,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {3136#(= 2 main_~sn~0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3136#(= 2 main_~sn~0)} is VALID [2022-04-08 09:01:29,163 INFO L272 TraceCheckUtils]: 9: Hoare triple {3136#(= 2 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:29,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:29,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:29,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:29,164 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3074#true} {3136#(= 2 main_~sn~0)} #46#return; {3136#(= 2 main_~sn~0)} is VALID [2022-04-08 09:01:29,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {3136#(= 2 main_~sn~0)} assume !false; {3136#(= 2 main_~sn~0)} is VALID [2022-04-08 09:01:29,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {3136#(= 2 main_~sn~0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-08 09:01:29,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-08 09:01:29,165 INFO L272 TraceCheckUtils]: 17: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:29,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:29,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:29,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:29,166 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3074#true} {3161#(= (+ (- 2) main_~sn~0) 2)} #46#return; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-08 09:01:29,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} assume !false; {3161#(= (+ (- 2) main_~sn~0) 2)} is VALID [2022-04-08 09:01:29,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {3161#(= (+ (- 2) main_~sn~0) 2)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3186#(= (+ (- 4) main_~sn~0) 2)} is VALID [2022-04-08 09:01:29,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {3186#(= (+ (- 4) main_~sn~0) 2)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3186#(= (+ (- 4) main_~sn~0) 2)} is VALID [2022-04-08 09:01:29,167 INFO L272 TraceCheckUtils]: 25: Hoare triple {3186#(= (+ (- 4) main_~sn~0) 2)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:29,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {3074#true} ~cond := #in~cond; {3196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:29,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {3196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:29,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:29,169 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3200#(not (= |__VERIFIER_assert_#in~cond| 0))} {3186#(= (+ (- 4) main_~sn~0) 2)} #46#return; {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} is VALID [2022-04-08 09:01:29,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} assume !false; {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} is VALID [2022-04-08 09:01:29,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} is VALID [2022-04-08 09:01:29,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {3207#(= 6 (mod (* main_~x~0 2) 4294967296))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-08 09:01:29,171 INFO L272 TraceCheckUtils]: 33: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:29,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:29,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:29,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:29,171 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3074#true} {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} #46#return; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-08 09:01:29,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} assume !false; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-08 09:01:29,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} is VALID [2022-04-08 09:01:29,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {3217#(= 6 (mod (+ (* main_~x~0 2) 4294967294) 4294967296))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} is VALID [2022-04-08 09:01:29,173 INFO L272 TraceCheckUtils]: 41: Hoare triple {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:29,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:29,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:29,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:29,174 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3074#true} {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} #46#return; {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} is VALID [2022-04-08 09:01:29,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} assume !false; {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} is VALID [2022-04-08 09:01:29,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {3242#(= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3264#(and (< (mod main_~x~0 4294967296) 10) (= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6))} is VALID [2022-04-08 09:01:29,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {3264#(and (< (mod main_~x~0 4294967296) 10) (= (mod (+ (* main_~x~0 2) 4294967292) 4294967296) 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} is VALID [2022-04-08 09:01:29,176 INFO L272 TraceCheckUtils]: 49: Hoare triple {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3074#true} is VALID [2022-04-08 09:01:29,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {3074#true} ~cond := #in~cond; {3074#true} is VALID [2022-04-08 09:01:29,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {3074#true} assume !(0 == ~cond); {3074#true} is VALID [2022-04-08 09:01:29,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {3074#true} assume true; {3074#true} is VALID [2022-04-08 09:01:29,177 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3074#true} {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} #46#return; {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} is VALID [2022-04-08 09:01:29,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} assume !false; {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} is VALID [2022-04-08 09:01:29,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {3268#(and (= (mod (+ (* main_~x~0 2) 4294967290) 4294967296) 6) (< (mod (+ main_~x~0 4294967295) 4294967296) 10))} assume !(~x~0 % 4294967296 < 10); {3075#false} is VALID [2022-04-08 09:01:29,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {3075#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3075#false} is VALID [2022-04-08 09:01:29,179 INFO L272 TraceCheckUtils]: 57: Hoare triple {3075#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3075#false} is VALID [2022-04-08 09:01:29,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2022-04-08 09:01:29,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {3075#false} assume 0 == ~cond; {3075#false} is VALID [2022-04-08 09:01:29,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2022-04-08 09:01:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 09:01:29,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:29,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749590037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:29,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:01:29,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2022-04-08 09:01:29,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095133096] [2022-04-08 09:01:29,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095133096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:29,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:29,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:01:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039436055] [2022-04-08 09:01:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:29,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 61 [2022-04-08 09:01:29,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:29,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:29,921 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-08 09:01:29,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:01:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:01:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:01:29,923 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:30,411 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-08 09:01:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:01:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 61 [2022-04-08 09:01:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 09:01:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 09:01:30,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 09:01:30,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:30,470 INFO L225 Difference]: With dead ends: 61 [2022-04-08 09:01:30,470 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 09:01:30,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 09:01:30,471 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:30,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 30 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 09:01:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 09:01:30,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:30,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:30,593 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:30,600 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:30,602 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 09:01:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 09:01:30,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:30,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:30,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-08 09:01:30,603 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-08 09:01:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:30,605 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 09:01:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 09:01:30,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:30,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:30,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:30,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-04-08 09:01:30,607 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 61 [2022-04-08 09:01:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:30,607 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-04-08 09:01:30,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 09:01:30,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 58 transitions. [2022-04-08 09:01:30,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-08 09:01:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 09:01:30,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:30,687 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:30,691 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-08 09:01:30,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:30,891 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1610935613, now seen corresponding path program 13 times [2022-04-08 09:01:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:30,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420909937] [2022-04-08 09:01:31,064 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:31,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1610935613, now seen corresponding path program 14 times [2022-04-08 09:01:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:31,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337754885] [2022-04-08 09:01:31,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {3785#(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(10, 2); {3744#true} is VALID [2022-04-08 09:01:31,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-08 09:01:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:01:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:01:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-08 09:01:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-08 09:01:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-08 09:01:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} #46#return; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-08 09:01:31,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:31,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(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(10, 2); {3744#true} is VALID [2022-04-08 09:01:31,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-08 09:01:31,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2022-04-08 09:01:31,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3749#(= main_~x~0 0)} is VALID [2022-04-08 09:01:31,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {3749#(= main_~x~0 0)} assume !false; {3749#(= main_~x~0 0)} is VALID [2022-04-08 09:01:31,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {3749#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3749#(= main_~x~0 0)} is VALID [2022-04-08 09:01:31,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {3749#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,209 INFO L272 TraceCheckUtils]: 9: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,210 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3744#true} {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,211 INFO L272 TraceCheckUtils]: 17: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,211 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3744#true} {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,212 INFO L272 TraceCheckUtils]: 25: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,213 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3744#true} {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,214 INFO L272 TraceCheckUtils]: 33: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,215 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,216 INFO L272 TraceCheckUtils]: 41: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,216 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,217 INFO L272 TraceCheckUtils]: 49: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,218 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3744#true} {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-08 09:01:31,219 INFO L272 TraceCheckUtils]: 57: Hoare triple {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,220 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3744#true} {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} #46#return; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-08 09:01:31,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !false; {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-08 09:01:31,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {3780#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 10); {3745#false} is VALID [2022-04-08 09:01:31,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {3745#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3745#false} is VALID [2022-04-08 09:01:31,220 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3745#false} is VALID [2022-04-08 09:01:31,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-08 09:01:31,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-08 09:01:31,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-08 09:01:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 09:01:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:31,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337754885] [2022-04-08 09:01:31,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337754885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:31,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646980303] [2022-04-08 09:01:31,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:31,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:31,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:31,222 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-08 09:01:31,223 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-08 09:01:31,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:31,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:31,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 09:01:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:31,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:31,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-08 09:01:31,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3744#true} is VALID [2022-04-08 09:01:31,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-08 09:01:31,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2022-04-08 09:01:31,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {3749#(= main_~x~0 0)} is VALID [2022-04-08 09:01:31,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {3749#(= main_~x~0 0)} assume !false; {3749#(= main_~x~0 0)} is VALID [2022-04-08 09:01:31,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {3749#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3749#(= main_~x~0 0)} is VALID [2022-04-08 09:01:31,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {3749#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,782 INFO L272 TraceCheckUtils]: 9: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,795 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3744#true} {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:31,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {3750#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,797 INFO L272 TraceCheckUtils]: 17: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,797 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3744#true} {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:31,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {3755#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,799 INFO L272 TraceCheckUtils]: 25: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,799 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3744#true} {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:31,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,801 INFO L272 TraceCheckUtils]: 33: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,802 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:31,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {3765#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,803 INFO L272 TraceCheckUtils]: 41: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,804 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:31,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {3770#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,805 INFO L272 TraceCheckUtils]: 49: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,805 INFO L290 TraceCheckUtils]: 51: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,806 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3744#true} {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:31,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {3775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:31,807 INFO L272 TraceCheckUtils]: 57: Hoare triple {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:31,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:31,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:31,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:31,808 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3744#true} {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:31,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:31,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {3957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {3745#false} is VALID [2022-04-08 09:01:31,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {3745#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3745#false} is VALID [2022-04-08 09:01:31,809 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3745#false} is VALID [2022-04-08 09:01:31,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-08 09:01:31,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-08 09:01:31,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-08 09:01:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 09:01:31,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:32,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-08 09:01:32,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-08 09:01:32,188 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-08 09:01:32,188 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3745#false} is VALID [2022-04-08 09:01:32,188 INFO L290 TraceCheckUtils]: 64: Hoare triple {3745#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {3745#false} is VALID [2022-04-08 09:01:32,190 INFO L290 TraceCheckUtils]: 63: Hoare triple {4009#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {3745#false} is VALID [2022-04-08 09:01:32,191 INFO L290 TraceCheckUtils]: 62: Hoare triple {4009#(< (mod main_~x~0 4294967296) 10)} assume !false; {4009#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:32,192 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3744#true} {4009#(< (mod main_~x~0 4294967296) 10)} #46#return; {4009#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:32,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:32,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:32,192 INFO L272 TraceCheckUtils]: 57: Hoare triple {4009#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:32,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4009#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:32,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:32,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:32,196 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3744#true} {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:32,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:32,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:32,196 INFO L272 TraceCheckUtils]: 49: Hoare triple {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:32,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4031#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:32,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:32,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:32,199 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:32,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:32,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:32,199 INFO L272 TraceCheckUtils]: 41: Hoare triple {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:32,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4056#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:32,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:32,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:32,203 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:32,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:32,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:32,204 INFO L272 TraceCheckUtils]: 33: Hoare triple {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:32,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4081#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:32,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:32,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:32,205 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3744#true} {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:32,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:32,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:32,206 INFO L272 TraceCheckUtils]: 25: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:32,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4106#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:32,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:32,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:32,207 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3744#true} {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #46#return; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:32,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:32,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:32,208 INFO L272 TraceCheckUtils]: 17: Hoare triple {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:32,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4131#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:32,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:32,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume !false; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:32,219 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3744#true} {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} #46#return; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:32,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 09:01:32,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 09:01:32,220 INFO L272 TraceCheckUtils]: 9: Hoare triple {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 09:01:32,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4156#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:32,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:32,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume !false; {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:32,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {4181#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:32,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret4 := main(); {3744#true} is VALID [2022-04-08 09:01:32,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #48#return; {3744#true} is VALID [2022-04-08 09:01:32,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 09:01:32,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3744#true} is VALID [2022-04-08 09:01:32,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-08 09:01:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 09:01:32,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646980303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:32,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:32,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 09:01:32,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:32,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420909937] [2022-04-08 09:01:32,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420909937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:32,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:32,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:01:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364332722] [2022-04-08 09:01:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:32,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 69 [2022-04-08 09:01:32,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:32,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:32,262 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-08 09:01:32,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:01:32,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:32,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:01:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:01:32,263 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:32,943 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-08 09:01:32,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:01:32,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 69 [2022-04-08 09:01:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-08 09:01:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-08 09:01:32,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-04-08 09:01:32,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:32,995 INFO L225 Difference]: With dead ends: 65 [2022-04-08 09:01:32,995 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 09:01:32,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2022-04-08 09:01:32,996 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:32,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 37 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:01:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 09:01:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-08 09:01:33,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:33,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:33,126 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:33,126 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:33,127 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-08 09:01:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-08 09:01:33,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:33,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:33,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 55 states. [2022-04-08 09:01:33,128 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 55 states. [2022-04-08 09:01:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:33,129 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-08 09:01:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-04-08 09:01:33,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:33,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:33,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:33,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 09:01:33,131 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 69 [2022-04-08 09:01:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:33,131 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 09:01:33,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 09:01:33,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 09:01:33,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 09:01:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 09:01:33,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:33,205 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:33,225 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-08 09:01:33,406 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,SelfDestructingSolverStorable8 [2022-04-08 09:01:33,406 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash -802632614, now seen corresponding path program 15 times [2022-04-08 09:01:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:33,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135897932] [2022-04-08 09:01:33,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:33,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -802632614, now seen corresponding path program 16 times [2022-04-08 09:01:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:33,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855651561] [2022-04-08 09:01:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {4618#(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(10, 2); {4572#true} is VALID [2022-04-08 09:01:33,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-08 09:01:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:01:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:01:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-08 09:01:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-08 09:01:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-08 09:01:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:01:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:33,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {4572#true} call ULTIMATE.init(); {4618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:33,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4618#(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(10, 2); {4572#true} is VALID [2022-04-08 09:01:33,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-08 09:01:33,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {4572#true} call #t~ret4 := main(); {4572#true} is VALID [2022-04-08 09:01:33,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {4572#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {4577#(= main_~x~0 0)} is VALID [2022-04-08 09:01:33,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {4577#(= main_~x~0 0)} assume !false; {4577#(= main_~x~0 0)} is VALID [2022-04-08 09:01:33,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4577#(= main_~x~0 0)} is VALID [2022-04-08 09:01:33,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {4577#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:33,798 INFO L272 TraceCheckUtils]: 9: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,798 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4572#true} {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:33,799 INFO L272 TraceCheckUtils]: 17: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,800 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4572#true} {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:33,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:33,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:33,801 INFO L272 TraceCheckUtils]: 25: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,801 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4572#true} {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:33,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:33,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:33,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:33,802 INFO L272 TraceCheckUtils]: 33: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,803 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4572#true} {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:33,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:33,804 INFO L272 TraceCheckUtils]: 41: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,805 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4572#true} {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:33,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:33,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:33,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:33,806 INFO L272 TraceCheckUtils]: 49: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,806 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4572#true} {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:33,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:33,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:33,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:33,807 INFO L272 TraceCheckUtils]: 57: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,808 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4572#true} {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:33,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:33,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:33,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:33,809 INFO L272 TraceCheckUtils]: 65: Hoare triple {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:33,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:33,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:33,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:33,810 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4572#true} {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:33,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:33,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {4613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {4573#false} is VALID [2022-04-08 09:01:33,811 INFO L290 TraceCheckUtils]: 72: Hoare triple {4573#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4573#false} is VALID [2022-04-08 09:01:33,811 INFO L272 TraceCheckUtils]: 73: Hoare triple {4573#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4573#false} is VALID [2022-04-08 09:01:33,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {4573#false} ~cond := #in~cond; {4573#false} is VALID [2022-04-08 09:01:33,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {4573#false} assume 0 == ~cond; {4573#false} is VALID [2022-04-08 09:01:33,811 INFO L290 TraceCheckUtils]: 76: Hoare triple {4573#false} assume !false; {4573#false} is VALID [2022-04-08 09:01:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 09:01:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855651561] [2022-04-08 09:01:33,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855651561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:33,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210275572] [2022-04-08 09:01:33,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:33,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:33,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:33,828 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-08 09:01:33,833 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-08 09:01:33,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:33,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:33,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 09:01:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:33,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:34,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {4572#true} call ULTIMATE.init(); {4572#true} is VALID [2022-04-08 09:01:34,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4572#true} is VALID [2022-04-08 09:01:34,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-08 09:01:34,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {4572#true} call #t~ret4 := main(); {4572#true} is VALID [2022-04-08 09:01:34,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {4572#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {4577#(= main_~x~0 0)} is VALID [2022-04-08 09:01:34,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {4577#(= main_~x~0 0)} assume !false; {4577#(= main_~x~0 0)} is VALID [2022-04-08 09:01:34,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4577#(= main_~x~0 0)} is VALID [2022-04-08 09:01:34,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {4577#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:34,293 INFO L272 TraceCheckUtils]: 9: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,294 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4572#true} {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:34,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:34,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:34,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {4578#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:34,295 INFO L272 TraceCheckUtils]: 17: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,296 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4572#true} {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:34,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:34,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:34,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {4583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:34,297 INFO L272 TraceCheckUtils]: 25: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,298 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4572#true} {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:34,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:34,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:34,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:34,299 INFO L272 TraceCheckUtils]: 33: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,300 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4572#true} {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:34,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:34,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:34,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {4593#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:34,301 INFO L272 TraceCheckUtils]: 41: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,302 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4572#true} {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:34,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:34,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:34,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {4598#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:34,303 INFO L272 TraceCheckUtils]: 49: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,303 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4572#true} {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:34,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:34,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:34,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {4603#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:34,305 INFO L272 TraceCheckUtils]: 57: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,305 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4572#true} {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:34,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:34,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:34,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {4608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:34,307 INFO L272 TraceCheckUtils]: 65: Hoare triple {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,307 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4572#true} {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:34,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !false; {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:34,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {4814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {4573#false} is VALID [2022-04-08 09:01:34,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {4573#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4573#false} is VALID [2022-04-08 09:01:34,308 INFO L272 TraceCheckUtils]: 73: Hoare triple {4573#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4573#false} is VALID [2022-04-08 09:01:34,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {4573#false} ~cond := #in~cond; {4573#false} is VALID [2022-04-08 09:01:34,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {4573#false} assume 0 == ~cond; {4573#false} is VALID [2022-04-08 09:01:34,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {4573#false} assume !false; {4573#false} is VALID [2022-04-08 09:01:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 09:01:34,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:34,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {4573#false} assume !false; {4573#false} is VALID [2022-04-08 09:01:34,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {4573#false} assume 0 == ~cond; {4573#false} is VALID [2022-04-08 09:01:34,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {4573#false} ~cond := #in~cond; {4573#false} is VALID [2022-04-08 09:01:34,651 INFO L272 TraceCheckUtils]: 73: Hoare triple {4573#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4573#false} is VALID [2022-04-08 09:01:34,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {4573#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4573#false} is VALID [2022-04-08 09:01:34,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {4866#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {4573#false} is VALID [2022-04-08 09:01:34,651 INFO L290 TraceCheckUtils]: 70: Hoare triple {4866#(< (mod main_~x~0 4294967296) 10)} assume !false; {4866#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:34,652 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4572#true} {4866#(< (mod main_~x~0 4294967296) 10)} #46#return; {4866#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:34,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,652 INFO L272 TraceCheckUtils]: 65: Hoare triple {4866#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,653 INFO L290 TraceCheckUtils]: 64: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4866#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:34,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:34,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:34,654 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4572#true} {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:34,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,655 INFO L272 TraceCheckUtils]: 57: Hoare triple {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4888#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:34,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:34,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:34,656 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4572#true} {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:34,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,657 INFO L272 TraceCheckUtils]: 49: Hoare triple {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4913#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:34,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:34,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:34,658 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4572#true} {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:34,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,659 INFO L272 TraceCheckUtils]: 41: Hoare triple {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4938#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:34,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:34,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:34,660 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4572#true} {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:34,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,661 INFO L272 TraceCheckUtils]: 33: Hoare triple {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4963#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:34,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,662 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4572#true} {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #46#return; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,662 INFO L272 TraceCheckUtils]: 25: Hoare triple {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {4988#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:34,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume !false; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:34,664 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4572#true} {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} #46#return; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:34,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,664 INFO L272 TraceCheckUtils]: 17: Hoare triple {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5013#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:34,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume !false; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,666 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4572#true} {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #46#return; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {4572#true} assume !(0 == ~cond); {4572#true} is VALID [2022-04-08 09:01:34,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {4572#true} ~cond := #in~cond; {4572#true} is VALID [2022-04-08 09:01:34,666 INFO L272 TraceCheckUtils]: 9: Hoare triple {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {4572#true} is VALID [2022-04-08 09:01:34,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5038#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:34,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-08 09:01:34,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume !false; {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-08 09:01:34,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {4572#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {5063#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-08 09:01:34,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {4572#true} call #t~ret4 := main(); {4572#true} is VALID [2022-04-08 09:01:34,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4572#true} {4572#true} #48#return; {4572#true} is VALID [2022-04-08 09:01:34,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {4572#true} assume true; {4572#true} is VALID [2022-04-08 09:01:34,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {4572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4572#true} is VALID [2022-04-08 09:01:34,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {4572#true} call ULTIMATE.init(); {4572#true} is VALID [2022-04-08 09:01:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 09:01:34,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210275572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:34,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:34,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 09:01:34,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:34,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135897932] [2022-04-08 09:01:34,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135897932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:34,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:34,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:01:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078242165] [2022-04-08 09:01:34,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:34,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 77 [2022-04-08 09:01:34,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:34,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:34,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:34,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:01:34,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:34,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:01:34,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:01:34,707 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:35,670 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-04-08 09:01:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:01:35,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 77 [2022-04-08 09:01:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-08 09:01:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-04-08 09:01:35,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2022-04-08 09:01:35,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:35,726 INFO L225 Difference]: With dead ends: 69 [2022-04-08 09:01:35,726 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 09:01:35,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:01:35,727 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:35,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 09:01:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 09:01:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-08 09:01:35,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:35,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 09:01:35,885 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 09:01:35,885 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 09:01:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:35,886 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 09:01:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 09:01:35,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:35,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:35,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 59 states. [2022-04-08 09:01:35,887 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 59 states. [2022-04-08 09:01:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:35,888 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 09:01:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 09:01:35,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:35,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:35,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:35,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 09:01:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-04-08 09:01:35,889 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 77 [2022-04-08 09:01:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:35,890 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-04-08 09:01:35,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 09:01:35,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 68 transitions. [2022-04-08 09:01:35,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-04-08 09:01:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 09:01:35,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:35,974 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:35,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 09:01:36,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 09:01:36,175 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -708952457, now seen corresponding path program 17 times [2022-04-08 09:01:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1669272215] [2022-04-08 09:01:36,425 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:36,425 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -708952457, now seen corresponding path program 18 times [2022-04-08 09:01:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:36,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125871638] [2022-04-08 09:01:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {5531#(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(10, 2); {5480#true} is VALID [2022-04-08 09:01:36,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-08 09:01:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 09:01:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 09:01:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:36,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:01:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 09:01:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-08 09:01:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-08 09:01:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-08 09:01:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:01:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-08 09:01:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:36,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:36,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:36,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {5531#(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(10, 2); {5480#true} is VALID [2022-04-08 09:01:36,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-08 09:01:36,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret4 := main(); {5480#true} is VALID [2022-04-08 09:01:36,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {5485#(= main_~x~0 0)} is VALID [2022-04-08 09:01:36,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#(= main_~x~0 0)} assume !false; {5485#(= main_~x~0 0)} is VALID [2022-04-08 09:01:36,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5485#(= main_~x~0 0)} is VALID [2022-04-08 09:01:36,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {5485#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:36,675 INFO L272 TraceCheckUtils]: 9: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,676 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5480#true} {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:36,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:36,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:36,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:36,678 INFO L272 TraceCheckUtils]: 17: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,678 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5480#true} {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:36,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:36,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:36,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:36,680 INFO L272 TraceCheckUtils]: 25: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,681 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5480#true} {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:36,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:36,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:36,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:36,682 INFO L272 TraceCheckUtils]: 33: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,683 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5480#true} {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:36,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:36,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:36,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:36,684 INFO L272 TraceCheckUtils]: 41: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,685 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5480#true} {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:36,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:36,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:36,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:36,686 INFO L272 TraceCheckUtils]: 49: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,687 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5480#true} {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:36,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:36,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:36,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:36,689 INFO L272 TraceCheckUtils]: 57: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,689 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5480#true} {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:36,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:36,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:36,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:36,691 INFO L272 TraceCheckUtils]: 65: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,691 INFO L290 TraceCheckUtils]: 67: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,691 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5480#true} {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:36,692 INFO L290 TraceCheckUtils]: 70: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !false; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:36,692 INFO L290 TraceCheckUtils]: 71: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:36,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:36,693 INFO L272 TraceCheckUtils]: 73: Hoare triple {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:36,693 INFO L290 TraceCheckUtils]: 74: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:36,693 INFO L290 TraceCheckUtils]: 75: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:36,693 INFO L290 TraceCheckUtils]: 76: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:36,694 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5480#true} {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:36,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:01:36,695 INFO L290 TraceCheckUtils]: 79: Hoare triple {5526#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {5481#false} is VALID [2022-04-08 09:01:36,695 INFO L290 TraceCheckUtils]: 80: Hoare triple {5481#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5481#false} is VALID [2022-04-08 09:01:36,695 INFO L272 TraceCheckUtils]: 81: Hoare triple {5481#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5481#false} is VALID [2022-04-08 09:01:36,695 INFO L290 TraceCheckUtils]: 82: Hoare triple {5481#false} ~cond := #in~cond; {5481#false} is VALID [2022-04-08 09:01:36,695 INFO L290 TraceCheckUtils]: 83: Hoare triple {5481#false} assume 0 == ~cond; {5481#false} is VALID [2022-04-08 09:01:36,695 INFO L290 TraceCheckUtils]: 84: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-08 09:01:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 09:01:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:36,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125871638] [2022-04-08 09:01:36,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125871638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:36,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624809723] [2022-04-08 09:01:36,696 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:01:36,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:36,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:36,706 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-08 09:01:36,708 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-08 09:01:37,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 09:01:37,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:37,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 09:01:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:37,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:37,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5480#true} is VALID [2022-04-08 09:01:37,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5480#true} is VALID [2022-04-08 09:01:37,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-08 09:01:37,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret4 := main(); {5480#true} is VALID [2022-04-08 09:01:37,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {5485#(= main_~x~0 0)} is VALID [2022-04-08 09:01:37,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#(= main_~x~0 0)} assume !false; {5485#(= main_~x~0 0)} is VALID [2022-04-08 09:01:37,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5485#(= main_~x~0 0)} is VALID [2022-04-08 09:01:37,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {5485#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:37,719 INFO L272 TraceCheckUtils]: 9: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,719 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5480#true} {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:37,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:37,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:01:37,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {5486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:37,721 INFO L272 TraceCheckUtils]: 17: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,721 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5480#true} {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:37,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:37,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:01:37,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {5491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:37,723 INFO L272 TraceCheckUtils]: 25: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,723 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5480#true} {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:37,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:37,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:01:37,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {5496#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:37,725 INFO L272 TraceCheckUtils]: 33: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,725 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5480#true} {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:37,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:37,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:01:37,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {5501#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:37,726 INFO L272 TraceCheckUtils]: 41: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,727 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5480#true} {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:37,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:37,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:01:37,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {5506#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:37,728 INFO L272 TraceCheckUtils]: 49: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,729 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5480#true} {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:37,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:37,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:01:37,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {5511#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:37,730 INFO L272 TraceCheckUtils]: 57: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,731 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5480#true} {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:37,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:37,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-08 09:01:37,732 INFO L290 TraceCheckUtils]: 64: Hoare triple {5516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:37,732 INFO L272 TraceCheckUtils]: 65: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,733 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5480#true} {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:37,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !false; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:37,733 INFO L290 TraceCheckUtils]: 71: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:01:37,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {5521#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-08 09:01:37,734 INFO L272 TraceCheckUtils]: 73: Hoare triple {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:37,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:37,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:37,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:37,734 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5480#true} {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #46#return; {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-08 09:01:37,735 INFO L290 TraceCheckUtils]: 78: Hoare triple {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !false; {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-08 09:01:37,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {5751#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {5481#false} is VALID [2022-04-08 09:01:37,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {5481#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5481#false} is VALID [2022-04-08 09:01:37,735 INFO L272 TraceCheckUtils]: 81: Hoare triple {5481#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5481#false} is VALID [2022-04-08 09:01:37,736 INFO L290 TraceCheckUtils]: 82: Hoare triple {5481#false} ~cond := #in~cond; {5481#false} is VALID [2022-04-08 09:01:37,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {5481#false} assume 0 == ~cond; {5481#false} is VALID [2022-04-08 09:01:37,736 INFO L290 TraceCheckUtils]: 84: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-08 09:01:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 09:01:37,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:38,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-08 09:01:38,130 INFO L290 TraceCheckUtils]: 83: Hoare triple {5481#false} assume 0 == ~cond; {5481#false} is VALID [2022-04-08 09:01:38,130 INFO L290 TraceCheckUtils]: 82: Hoare triple {5481#false} ~cond := #in~cond; {5481#false} is VALID [2022-04-08 09:01:38,130 INFO L272 TraceCheckUtils]: 81: Hoare triple {5481#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5481#false} is VALID [2022-04-08 09:01:38,130 INFO L290 TraceCheckUtils]: 80: Hoare triple {5481#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5481#false} is VALID [2022-04-08 09:01:38,131 INFO L290 TraceCheckUtils]: 79: Hoare triple {5803#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {5481#false} is VALID [2022-04-08 09:01:38,131 INFO L290 TraceCheckUtils]: 78: Hoare triple {5803#(< (mod main_~x~0 4294967296) 10)} assume !false; {5803#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:38,131 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5480#true} {5803#(< (mod main_~x~0 4294967296) 10)} #46#return; {5803#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:38,131 INFO L290 TraceCheckUtils]: 76: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,131 INFO L290 TraceCheckUtils]: 75: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,132 INFO L290 TraceCheckUtils]: 74: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,132 INFO L272 TraceCheckUtils]: 73: Hoare triple {5803#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,132 INFO L290 TraceCheckUtils]: 72: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5803#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-08 09:01:38,133 INFO L290 TraceCheckUtils]: 71: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:38,133 INFO L290 TraceCheckUtils]: 70: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:38,133 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5480#true} {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:38,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,133 INFO L290 TraceCheckUtils]: 67: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,134 INFO L272 TraceCheckUtils]: 65: Hoare triple {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5825#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-08 09:01:38,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:38,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:38,137 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5480#true} {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:38,137 INFO L290 TraceCheckUtils]: 60: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,137 INFO L272 TraceCheckUtils]: 57: Hoare triple {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5850#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-08 09:01:38,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:38,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:38,139 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5480#true} {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:38,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,139 INFO L272 TraceCheckUtils]: 49: Hoare triple {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5875#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-08 09:01:38,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:38,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:38,141 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5480#true} {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:38,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,141 INFO L272 TraceCheckUtils]: 41: Hoare triple {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5900#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-08 09:01:38,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,143 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5480#true} {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #46#return; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,143 INFO L272 TraceCheckUtils]: 33: Hoare triple {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5925#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:38,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume !false; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:38,145 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5480#true} {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} #46#return; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:38,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,145 INFO L272 TraceCheckUtils]: 25: Hoare triple {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5950#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-08 09:01:38,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume !false; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,151 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5480#true} {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #46#return; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,152 INFO L272 TraceCheckUtils]: 17: Hoare triple {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {5975#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-08 09:01:38,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-08 09:01:38,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume !false; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-08 09:01:38,154 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5480#true} {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} #46#return; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-08 09:01:38,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#true} assume !(0 == ~cond); {5480#true} is VALID [2022-04-08 09:01:38,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {5480#true} ~cond := #in~cond; {5480#true} is VALID [2022-04-08 09:01:38,154 INFO L272 TraceCheckUtils]: 9: Hoare triple {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {5480#true} is VALID [2022-04-08 09:01:38,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {6000#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-08 09:01:38,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} is VALID [2022-04-08 09:01:38,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} assume !false; {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} is VALID [2022-04-08 09:01:38,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {6025#(< (mod (+ main_~x~0 9) 4294967296) 10)} is VALID [2022-04-08 09:01:38,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret4 := main(); {5480#true} is VALID [2022-04-08 09:01:38,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #48#return; {5480#true} is VALID [2022-04-08 09:01:38,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-08 09:01:38,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5480#true} is VALID [2022-04-08 09:01:38,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5480#true} is VALID [2022-04-08 09:01:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 09:01:38,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624809723] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:38,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:38,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 09:01:38,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:38,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1669272215] [2022-04-08 09:01:38,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1669272215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:38,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:38,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 09:01:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020720977] [2022-04-08 09:01:38,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:38,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 85 [2022-04-08 09:01:38,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:38,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:38,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:38,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 09:01:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:38,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 09:01:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-04-08 09:01:38,192 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:39,335 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-08 09:01:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 09:01:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 85 [2022-04-08 09:01:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-08 09:01:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-08 09:01:39,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 77 transitions. [2022-04-08 09:01:39,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:39,392 INFO L225 Difference]: With dead ends: 73 [2022-04-08 09:01:39,392 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 09:01:39,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 09:01:39,393 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:39,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 81 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 09:01:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 09:01:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-08 09:01:39,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:39,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:01:39,526 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:01:39,535 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:01:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:39,541 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 09:01:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-08 09:01:39,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:39,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:39,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-08 09:01:39,544 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-08 09:01:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:39,545 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 09:01:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-08 09:01:39,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:39,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:39,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:39,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:01:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-04-08 09:01:39,549 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 85 [2022-04-08 09:01:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:39,549 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-04-08 09:01:39,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 09:01:39,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 73 transitions. [2022-04-08 09:01:39,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-08 09:01:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 09:01:39,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:39,638 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:39,646 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-08 09:01:39,838 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,SelfDestructingSolverStorable10 [2022-04-08 09:01:39,839 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1149090924, now seen corresponding path program 19 times [2022-04-08 09:01:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:39,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1671679847] [2022-04-08 09:01:40,000 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:40,000 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1149090924, now seen corresponding path program 20 times [2022-04-08 09:01:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:40,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497165647] [2022-04-08 09:01:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:01:40,053 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 09:01:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:01:40,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 09:01:40,111 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 09:01:40,111 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 09:01:40,113 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:01:40,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 09:01:40,119 INFO L719 BasicCegarLoop]: Path program histogram: [20, 2, 2] [2022-04-08 09:01:40,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:01:40,136 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 09:01:40,137 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-08 09:01:40,138 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 09:01:40,138 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-08 09:01:40,138 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-08 09:01:40,138 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:01:40,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:01:40 BoogieIcfgContainer [2022-04-08 09:01:40,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:01:40,139 INFO L158 Benchmark]: Toolchain (without parser) took 27363.83ms. Allocated memory was 170.9MB in the beginning and 381.7MB in the end (delta: 210.8MB). Free memory was 118.5MB in the beginning and 162.9MB in the end (delta: -44.4MB). Peak memory consumption was 167.6MB. Max. memory is 8.0GB. [2022-04-08 09:01:40,139 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:01:40,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.76ms. Allocated memory was 170.9MB in the beginning and 250.6MB in the end (delta: 79.7MB). Free memory was 118.3MB in the beginning and 226.0MB in the end (delta: -107.6MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-08 09:01:40,140 INFO L158 Benchmark]: Boogie Preprocessor took 31.81ms. Allocated memory is still 250.6MB. Free memory was 226.0MB in the beginning and 224.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:01:40,140 INFO L158 Benchmark]: RCFGBuilder took 242.84ms. Allocated memory is still 250.6MB. Free memory was 224.5MB in the beginning and 214.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:01:40,140 INFO L158 Benchmark]: TraceAbstraction took 26889.26ms. Allocated memory was 250.6MB in the beginning and 381.7MB in the end (delta: 131.1MB). Free memory was 213.4MB in the beginning and 162.9MB in the end (delta: 50.5MB). Peak memory consumption was 182.1MB. Max. memory is 8.0GB. [2022-04-08 09:01:40,141 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.76ms. Allocated memory was 170.9MB in the beginning and 250.6MB in the end (delta: 79.7MB). Free memory was 118.3MB in the beginning and 226.0MB in the end (delta: -107.6MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.81ms. Allocated memory is still 250.6MB. Free memory was 226.0MB in the beginning and 224.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 242.84ms. Allocated memory is still 250.6MB. Free memory was 224.5MB in the beginning and 214.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 26889.26ms. Allocated memory was 250.6MB in the beginning and 381.7MB in the end (delta: 131.1MB). Free memory was 213.4MB in the beginning and 162.9MB in the end (delta: 50.5MB). Peak memory consumption was 182.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND TRUE x<10 [L26] sn = sn + (2) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 [L25] COND FALSE !(x<10) [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND TRUE !(cond) [L15] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1778 IncrementalHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 212 mSDtfsCounter, 1778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 967 SyntacticMatches, 10 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=11, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-08 09:01:40,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...