/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-crafted-1/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:14:05,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:14:05,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:14:05,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:14:05,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:14:05,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:14:05,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:14:05,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:14:05,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:14:05,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:14:05,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:14:05,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:14:05,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:14:05,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:14:05,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:14:05,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:14:05,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:14:05,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:14:05,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:14:05,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:14:05,193 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:14:05,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:14:05,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:14:05,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:14:05,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:14:05,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:14:05,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:14:05,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:14:05,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:14:05,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:14:05,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:14:05,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:14:05,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:14:05,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:14:05,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:14:05,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:14:05,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:14:05,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:14:05,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:14:05,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:14:05,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:14:05,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:14:05,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:14:05,218 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:14:05,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:14:05,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:14:05,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:14:05,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:14:05,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:14:05,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:14:05,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:14:05,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:14:05,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:14:05,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:14:05,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:14:05,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:14:05,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:14:05,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:14:05,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:14:05,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:14:05,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:14:05,221 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:14:05,221 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:14:05,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:14:05,221 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:14:05,221 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:14:05,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:14:05,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:14:05,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:14:05,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:14:05,425 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:14:05,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-28 10:14:05,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bd66ffa/1adf9d097fcf4703b40b6c461159c747/FLAGaa4ebdacb [2022-04-28 10:14:05,753 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:14:05,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-28 10:14:05,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bd66ffa/1adf9d097fcf4703b40b6c461159c747/FLAGaa4ebdacb [2022-04-28 10:14:06,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bd66ffa/1adf9d097fcf4703b40b6c461159c747 [2022-04-28 10:14:06,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:14:06,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:14:06,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:14:06,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:14:06,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:14:06,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204a9915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06, skipping insertion in model container [2022-04-28 10:14:06,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:14:06,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:14:06,335 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-crafted-1/mono-crafted_11.c[319,332] [2022-04-28 10:14:06,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:14:06,374 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:14:06,382 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-crafted-1/mono-crafted_11.c[319,332] [2022-04-28 10:14:06,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:14:06,416 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:14:06,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06 WrapperNode [2022-04-28 10:14:06,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:14:06,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:14:06,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:14:06,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:14:06,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:14:06,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:14:06,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:14:06,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:14:06,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (1/1) ... [2022-04-28 10:14:06,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:14:06,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:06,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:14:06,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:14:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:14:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:14:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:14:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:14:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:14:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:14:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:14:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:14:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:14:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:14:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:14:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:14:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:14:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:14:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:14:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:14:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:14:06,602 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:14:06,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:14:06,731 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:14:06,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:14:06,736 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:14:06,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:14:06 BoogieIcfgContainer [2022-04-28 10:14:06,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:14:06,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:14:06,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:14:06,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:14:06,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:14:06" (1/3) ... [2022-04-28 10:14:06,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faeaf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:14:06, skipping insertion in model container [2022-04-28 10:14:06,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:06" (2/3) ... [2022-04-28 10:14:06,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faeaf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:14:06, skipping insertion in model container [2022-04-28 10:14:06,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:14:06" (3/3) ... [2022-04-28 10:14:06,758 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2022-04-28 10:14:06,768 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:14:06,768 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:14:06,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:14:06,827 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@57d365be, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4bdc52c3 [2022-04-28 10:14:06,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:14:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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-28 10:14:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:14:06,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:06,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:06,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-04-28 10:14:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:06,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888175390] [2022-04-28 10:14:06,870 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:14:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 2 times [2022-04-28 10:14:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:06,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010642599] [2022-04-28 10:14:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:06,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:06,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 10:14:06,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:14:06,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-28 10:14:06,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:06,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 10:14:06,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:14:06,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-28 10:14:06,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-28 10:14:06,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0; {23#true} is VALID [2022-04-28 10:14:06,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 10:14:06,983 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-28 10:14:06,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 10:14:06,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 10:14:06,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 10:14:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010642599] [2022-04-28 10:14:06,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010642599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:06,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:06,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:14:06,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:06,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888175390] [2022-04-28 10:14:06,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888175390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:06,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:06,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:14:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298026124] [2022-04-28 10:14:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:06,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:14:06,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:06,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:14:07,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:07,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:14:07,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:14:07,032 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,124 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 10:14:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:14:07,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:14:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 10:14:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 10:14:07,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-28 10:14:07,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,214 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:14:07,214 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 10:14:07,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:14:07,218 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:07,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 10:14:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 10:14:07,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:07,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,292 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,292 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,311 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 10:14:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 10:14:07,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:07,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:07,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 10:14:07,312 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 10:14:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,313 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 10:14:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 10:14:07,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:07,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:07,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:07,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 10:14:07,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 10:14:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:07,316 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 10:14:07,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 10:14:07,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 10:14:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:14:07,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:07,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:07,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:14:07,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-28 10:14:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:07,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490429263] [2022-04-28 10:14:07,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:14:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 2 times [2022-04-28 10:14:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724903964] [2022-04-28 10:14:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(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(18, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 10:14:07,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 10:14:07,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-28 10:14:07,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:07,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(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(18, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 10:14:07,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 10:14:07,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-28 10:14:07,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2022-04-28 10:14:07,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0; {152#(= main_~x~0 0)} is VALID [2022-04-28 10:14:07,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {148#false} is VALID [2022-04-28 10:14:07,490 INFO L272 TraceCheckUtils]: 7: Hoare triple {148#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {148#false} is VALID [2022-04-28 10:14:07,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-04-28 10:14:07,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-04-28 10:14:07,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-28 10:14:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:07,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724903964] [2022-04-28 10:14:07,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724903964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:07,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:07,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:14:07,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:07,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1490429263] [2022-04-28 10:14:07,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1490429263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:07,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:07,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:14:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721186892] [2022-04-28 10:14:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:07,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:14:07,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:07,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:14:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:14:07,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:14:07,517 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,580 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 10:14:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:14:07,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:14:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 10:14:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 10:14:07,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 10:14:07,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,619 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:14:07,619 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:14:07,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:14:07,620 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:07,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:14:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:14:07,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:07,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,624 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,624 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,625 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 10:14:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:14:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:07,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:07,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:14:07,626 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:14:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,627 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 10:14:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:14:07,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:07,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:07,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:07,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 10:14:07,628 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 10:14:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:07,628 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 10:14:07,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 10:14:07,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:14:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:14:07,646 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:07,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:07,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:14:07,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-04-28 10:14:07,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:07,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2137734930] [2022-04-28 10:14:07,664 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:07,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 2 times [2022-04-28 10:14:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:07,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864598116] [2022-04-28 10:14:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(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(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 10:14:07,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 10:14:07,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 10:14:07,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:07,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(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(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 10:14:07,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 10:14:07,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 10:14:07,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret5 := main(); {262#true} is VALID [2022-04-28 10:14:07,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0; {267#(= main_~x~0 0)} is VALID [2022-04-28 10:14:07,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {267#(= main_~x~0 0)} is VALID [2022-04-28 10:14:07,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {268#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:14:07,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 100000000); {263#false} is VALID [2022-04-28 10:14:07,752 INFO L272 TraceCheckUtils]: 9: Hoare triple {263#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {263#false} is VALID [2022-04-28 10:14:07,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 10:14:07,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 10:14:07,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 10:14:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:07,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864598116] [2022-04-28 10:14:07,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864598116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:07,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88925904] [2022-04-28 10:14:07,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:07,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:07,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:07,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:14:07,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:07,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:07,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:14:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:07,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-28 10:14:07,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#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(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 10:14:07,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 10:14:07,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 10:14:07,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret5 := main(); {262#true} is VALID [2022-04-28 10:14:07,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0; {267#(= main_~x~0 0)} is VALID [2022-04-28 10:14:07,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {267#(= main_~x~0 0)} is VALID [2022-04-28 10:14:07,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {294#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 10:14:07,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 100000000); {263#false} is VALID [2022-04-28 10:14:07,868 INFO L272 TraceCheckUtils]: 9: Hoare triple {263#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {263#false} is VALID [2022-04-28 10:14:07,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 10:14:07,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 10:14:07,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 10:14:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:07,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:07,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 10:14:07,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 10:14:07,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 10:14:07,939 INFO L272 TraceCheckUtils]: 9: Hoare triple {263#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {263#false} is VALID [2022-04-28 10:14:07,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {263#false} is VALID [2022-04-28 10:14:07,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {322#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-28 10:14:07,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {326#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {326#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-28 10:14:07,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0; {326#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-28 10:14:07,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret5 := main(); {262#true} is VALID [2022-04-28 10:14:07,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 10:14:07,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 10:14:07,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#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(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 10:14:07,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-28 10:14:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:07,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88925904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:07,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:07,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 10:14:07,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:07,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2137734930] [2022-04-28 10:14:07,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2137734930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:07,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:07,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:14:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317603728] [2022-04-28 10:14:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:14:07,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:07,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:07,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:14:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:14:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:14:07,954 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:08,009 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 10:14:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:14:08,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:14:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 10:14:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 10:14:08,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 10:14:08,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:08,033 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:14:08,033 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:14:08,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-28 10:14:08,034 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:08,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:14:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:14:08,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:08,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,040 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,040 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:08,041 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 10:14:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 10:14:08,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:08,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:08,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:14:08,041 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:14:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:08,042 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 10:14:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 10:14:08,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:08,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:08,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:08,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 10:14:08,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-04-28 10:14:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:08,044 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 10:14:08,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 10:14:08,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 10:14:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:14:08,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:08,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:08,078 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-28 10:14:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:08,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1002491197, now seen corresponding path program 3 times [2022-04-28 10:14:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505976123] [2022-04-28 10:14:08,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:08,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1002491197, now seen corresponding path program 4 times [2022-04-28 10:14:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:08,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942747962] [2022-04-28 10:14:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:08,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#(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(18, 2);call #Ultimate.allocInit(12, 3); {470#true} is VALID [2022-04-28 10:14:08,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#true} assume true; {470#true} is VALID [2022-04-28 10:14:08,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {470#true} {470#true} #41#return; {470#true} is VALID [2022-04-28 10:14:08,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {470#true} call ULTIMATE.init(); {478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:08,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#(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(18, 2);call #Ultimate.allocInit(12, 3); {470#true} is VALID [2022-04-28 10:14:08,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {470#true} assume true; {470#true} is VALID [2022-04-28 10:14:08,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {470#true} {470#true} #41#return; {470#true} is VALID [2022-04-28 10:14:08,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {470#true} call #t~ret5 := main(); {470#true} is VALID [2022-04-28 10:14:08,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {470#true} ~x~0 := 0; {475#(= main_~x~0 0)} is VALID [2022-04-28 10:14:08,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {475#(= main_~x~0 0)} is VALID [2022-04-28 10:14:08,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:08,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:08,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:08,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 100000000); {471#false} is VALID [2022-04-28 10:14:08,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {471#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {471#false} is VALID [2022-04-28 10:14:08,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#false} ~cond := #in~cond; {471#false} is VALID [2022-04-28 10:14:08,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#false} assume 0 == ~cond; {471#false} is VALID [2022-04-28 10:14:08,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#false} assume !false; {471#false} is VALID [2022-04-28 10:14:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:08,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942747962] [2022-04-28 10:14:08,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942747962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:08,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704742894] [2022-04-28 10:14:08,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:08,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:08,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:08,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:14:08,418 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:08,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:08,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:14:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:08,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:08,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {470#true} call ULTIMATE.init(); {470#true} is VALID [2022-04-28 10:14:08,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#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(18, 2);call #Ultimate.allocInit(12, 3); {470#true} is VALID [2022-04-28 10:14:08,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {470#true} assume true; {470#true} is VALID [2022-04-28 10:14:08,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {470#true} {470#true} #41#return; {470#true} is VALID [2022-04-28 10:14:08,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {470#true} call #t~ret5 := main(); {470#true} is VALID [2022-04-28 10:14:08,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {470#true} ~x~0 := 0; {475#(= main_~x~0 0)} is VALID [2022-04-28 10:14:08,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {475#(= main_~x~0 0)} is VALID [2022-04-28 10:14:08,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:08,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:08,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:08,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 100000000); {509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:08,684 INFO L272 TraceCheckUtils]: 11: Hoare triple {509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:08,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:08,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {471#false} is VALID [2022-04-28 10:14:08,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#false} assume !false; {471#false} is VALID [2022-04-28 10:14:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:08,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:08,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#false} assume !false; {471#false} is VALID [2022-04-28 10:14:08,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {471#false} is VALID [2022-04-28 10:14:08,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:08,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {536#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:08,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {536#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:08,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {536#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:08,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {543#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:08,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {543#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:08,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {536#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:08,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {470#true} ~x~0 := 0; {536#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:08,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {470#true} call #t~ret5 := main(); {470#true} is VALID [2022-04-28 10:14:08,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {470#true} {470#true} #41#return; {470#true} is VALID [2022-04-28 10:14:08,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {470#true} assume true; {470#true} is VALID [2022-04-28 10:14:08,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#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(18, 2);call #Ultimate.allocInit(12, 3); {470#true} is VALID [2022-04-28 10:14:08,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {470#true} call ULTIMATE.init(); {470#true} is VALID [2022-04-28 10:14:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:14:08,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704742894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:08,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:08,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2022-04-28 10:14:08,791 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:08,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505976123] [2022-04-28 10:14:08,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505976123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:08,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:08,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:14:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867757747] [2022-04-28 10:14:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:14:08,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:08,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:08,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:14:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:08,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:14:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:14:08,804 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:08,896 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 10:14:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:14:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:14:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 10:14:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 10:14:08,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-28 10:14:08,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:08,926 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:14:08,926 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:14:08,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:14:08,928 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:08,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:14:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:14:08,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:08,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,938 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,938 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:08,939 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 10:14:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 10:14:08,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:08,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:08,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:14:08,941 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:14:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:08,943 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 10:14:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 10:14:08,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:08,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:08,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:08,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 10:14:08,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-28 10:14:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:08,947 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 10:14:08,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:08,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 10:14:08,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 10:14:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:14:08,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:08,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:08,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:09,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:14:09,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1927821798, now seen corresponding path program 5 times [2022-04-28 10:14:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:09,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178479423] [2022-04-28 10:14:09,185 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:09,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1927821798, now seen corresponding path program 6 times [2022-04-28 10:14:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:09,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110561571] [2022-04-28 10:14:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:09,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {716#(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(18, 2);call #Ultimate.allocInit(12, 3); {707#true} is VALID [2022-04-28 10:14:09,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-28 10:14:09,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {707#true} {707#true} #41#return; {707#true} is VALID [2022-04-28 10:14:09,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:09,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#(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(18, 2);call #Ultimate.allocInit(12, 3); {707#true} is VALID [2022-04-28 10:14:09,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-28 10:14:09,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #41#return; {707#true} is VALID [2022-04-28 10:14:09,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-28 10:14:09,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#true} ~x~0 := 0; {712#(= main_~x~0 0)} is VALID [2022-04-28 10:14:09,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {712#(= main_~x~0 0)} is VALID [2022-04-28 10:14:09,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {713#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:09,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {713#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {713#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:09,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {714#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:09,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {714#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {714#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:09,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {715#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 10:14:09,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 100000000); {708#false} is VALID [2022-04-28 10:14:09,309 INFO L272 TraceCheckUtils]: 13: Hoare triple {708#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {708#false} is VALID [2022-04-28 10:14:09,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2022-04-28 10:14:09,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {708#false} assume 0 == ~cond; {708#false} is VALID [2022-04-28 10:14:09,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-28 10:14:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:09,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110561571] [2022-04-28 10:14:09,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110561571] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:09,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31290211] [2022-04-28 10:14:09,310 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:09,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:09,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:14:09,338 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:14:09,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:09,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:14:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:09,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:09,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-28 10:14:09,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#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(18, 2);call #Ultimate.allocInit(12, 3); {707#true} is VALID [2022-04-28 10:14:09,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-28 10:14:09,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #41#return; {707#true} is VALID [2022-04-28 10:14:09,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-28 10:14:09,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#true} ~x~0 := 0; {707#true} is VALID [2022-04-28 10:14:09,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {707#true} assume !!(~x~0 % 4294967296 < 100000000); {707#true} is VALID [2022-04-28 10:14:09,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {707#true} is VALID [2022-04-28 10:14:09,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !!(~x~0 % 4294967296 < 100000000); {707#true} is VALID [2022-04-28 10:14:09,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {707#true} is VALID [2022-04-28 10:14:09,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#true} assume !!(~x~0 % 4294967296 < 100000000); {707#true} is VALID [2022-04-28 10:14:09,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {753#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-28 10:14:09,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {708#false} is VALID [2022-04-28 10:14:09,583 INFO L272 TraceCheckUtils]: 13: Hoare triple {708#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {708#false} is VALID [2022-04-28 10:14:09,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2022-04-28 10:14:09,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {708#false} assume 0 == ~cond; {708#false} is VALID [2022-04-28 10:14:09,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-28 10:14:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:14:09,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:14:09,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31290211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:09,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:14:09,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-04-28 10:14:09,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:09,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178479423] [2022-04-28 10:14:09,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178479423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:09,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:09,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:14:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338343654] [2022-04-28 10:14:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:14:09,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:09,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:09,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:14:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:14:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:14:09,594 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:09,628 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 10:14:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:14:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:14:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-28 10:14:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-28 10:14:09,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-04-28 10:14:09,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:09,653 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:14:09,653 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:14:09,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:14:09,654 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:09,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:14:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 10:14:09,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:09,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,665 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,665 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:09,666 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 10:14:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 10:14:09,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:09,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:09,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:14:09,667 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:14:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:09,668 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 10:14:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 10:14:09,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:09,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:09,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:09,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 10:14:09,669 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2022-04-28 10:14:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:09,669 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 10:14:09,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:09,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 10:14:09,688 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-28 10:14:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 10:14:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:14:09,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:09,688 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:09,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:09,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:09,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash -402805515, now seen corresponding path program 1 times [2022-04-28 10:14:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:09,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635232472] [2022-04-28 10:14:09,901 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:09,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:09,901 INFO L85 PathProgramCache]: Analyzing trace with hash -402805515, now seen corresponding path program 2 times [2022-04-28 10:14:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:09,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016501078] [2022-04-28 10:14:09,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:09,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:09,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#(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(18, 2);call #Ultimate.allocInit(12, 3); {902#true} is VALID [2022-04-28 10:14:09,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {902#true} assume true; {902#true} is VALID [2022-04-28 10:14:09,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {902#true} {902#true} #41#return; {902#true} is VALID [2022-04-28 10:14:09,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {902#true} call ULTIMATE.init(); {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:09,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#(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(18, 2);call #Ultimate.allocInit(12, 3); {902#true} is VALID [2022-04-28 10:14:09,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {902#true} assume true; {902#true} is VALID [2022-04-28 10:14:09,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {902#true} {902#true} #41#return; {902#true} is VALID [2022-04-28 10:14:09,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {902#true} call #t~ret5 := main(); {902#true} is VALID [2022-04-28 10:14:09,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {902#true} ~x~0 := 0; {907#(= main_~x~0 0)} is VALID [2022-04-28 10:14:09,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {907#(= main_~x~0 0)} is VALID [2022-04-28 10:14:09,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:09,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:09,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:09,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:09,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 10:14:09,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 100000000); {910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 10:14:09,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {903#false} is VALID [2022-04-28 10:14:09,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#false} assume !(~x~0 % 4294967296 < 100000000); {903#false} is VALID [2022-04-28 10:14:09,991 INFO L272 TraceCheckUtils]: 15: Hoare triple {903#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {903#false} is VALID [2022-04-28 10:14:09,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {903#false} ~cond := #in~cond; {903#false} is VALID [2022-04-28 10:14:09,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {903#false} assume 0 == ~cond; {903#false} is VALID [2022-04-28 10:14:09,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {903#false} assume !false; {903#false} is VALID [2022-04-28 10:14:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:09,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:09,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016501078] [2022-04-28 10:14:09,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016501078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:09,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747236035] [2022-04-28 10:14:09,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:09,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:10,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 10:14:10,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:10,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:10,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:14:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:10,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:10,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {902#true} call ULTIMATE.init(); {902#true} is VALID [2022-04-28 10:14:10,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {902#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(18, 2);call #Ultimate.allocInit(12, 3); {902#true} is VALID [2022-04-28 10:14:10,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {902#true} assume true; {902#true} is VALID [2022-04-28 10:14:10,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {902#true} {902#true} #41#return; {902#true} is VALID [2022-04-28 10:14:10,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {902#true} call #t~ret5 := main(); {902#true} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {902#true} ~x~0 := 0; {907#(= main_~x~0 0)} is VALID [2022-04-28 10:14:10,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {907#(= main_~x~0 0)} is VALID [2022-04-28 10:14:10,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:10,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:10,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:10,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:10,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {948#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:10,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {948#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {948#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:10,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {948#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:10,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 100000000); {903#false} is VALID [2022-04-28 10:14:10,337 INFO L272 TraceCheckUtils]: 15: Hoare triple {903#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {903#false} is VALID [2022-04-28 10:14:10,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {903#false} ~cond := #in~cond; {903#false} is VALID [2022-04-28 10:14:10,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {903#false} assume 0 == ~cond; {903#false} is VALID [2022-04-28 10:14:10,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {903#false} assume !false; {903#false} is VALID [2022-04-28 10:14:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:10,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:10,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {903#false} assume !false; {903#false} is VALID [2022-04-28 10:14:10,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {903#false} assume 0 == ~cond; {903#false} is VALID [2022-04-28 10:14:10,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {903#false} ~cond := #in~cond; {903#false} is VALID [2022-04-28 10:14:10,454 INFO L272 TraceCheckUtils]: 15: Hoare triple {903#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {903#false} is VALID [2022-04-28 10:14:10,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {983#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {903#false} is VALID [2022-04-28 10:14:10,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {987#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {983#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {987#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {987#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {994#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {987#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {994#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {994#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {1001#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {994#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {1001#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1001#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {1008#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1001#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {1008#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1008#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {902#true} ~x~0 := 0; {1008#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:10,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {902#true} call #t~ret5 := main(); {902#true} is VALID [2022-04-28 10:14:10,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {902#true} {902#true} #41#return; {902#true} is VALID [2022-04-28 10:14:10,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {902#true} assume true; {902#true} is VALID [2022-04-28 10:14:10,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {902#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(18, 2);call #Ultimate.allocInit(12, 3); {902#true} is VALID [2022-04-28 10:14:10,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {902#true} call ULTIMATE.init(); {902#true} is VALID [2022-04-28 10:14:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:10,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747236035] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:10,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:10,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-28 10:14:10,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:10,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635232472] [2022-04-28 10:14:10,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635232472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:10,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:10,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:14:10,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779246597] [2022-04-28 10:14:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:10,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:14:10,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:10,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:10,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:14:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:14:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:14:10,483 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:10,648 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 10:14:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:14:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:14:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:14:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:14:10,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-28 10:14:10,672 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-28 10:14:10,673 INFO L225 Difference]: With dead ends: 30 [2022-04-28 10:14:10,673 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:14:10,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:14:10,674 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:10,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:14:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 10:14:10,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:10,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,688 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,688 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:10,688 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 10:14:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 10:14:10,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:10,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:10,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:14:10,689 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:14:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:10,690 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 10:14:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 10:14:10,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:10,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:10,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:10,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-28 10:14:10,691 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2022-04-28 10:14:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:10,691 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-28 10:14:10,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:10,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-28 10:14:10,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 10:14:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:14:10,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:10,711 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:10,739 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-28 10:14:10,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:10,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1363341138, now seen corresponding path program 3 times [2022-04-28 10:14:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:10,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427994336] [2022-04-28 10:14:10,924 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:10,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1363341138, now seen corresponding path program 4 times [2022-04-28 10:14:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:10,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064412728] [2022-04-28 10:14:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:11,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1198#(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(18, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 10:14:11,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 10:14:11,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1188#true} {1188#true} #41#return; {1188#true} is VALID [2022-04-28 10:14:11,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:11,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#(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(18, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 10:14:11,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 10:14:11,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #41#return; {1188#true} is VALID [2022-04-28 10:14:11,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 10:14:11,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} ~x~0 := 0; {1193#(= main_~x~0 0)} is VALID [2022-04-28 10:14:11,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {1193#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1193#(= main_~x~0 0)} is VALID [2022-04-28 10:14:11,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:11,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:11,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:11,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:11,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:11,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:11,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1197#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:14:11,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {1197#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:14:11,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1189#false} is VALID [2022-04-28 10:14:11,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#false} assume !(~x~0 % 4294967296 < 100000000); {1189#false} is VALID [2022-04-28 10:14:11,032 INFO L272 TraceCheckUtils]: 17: Hoare triple {1189#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1189#false} is VALID [2022-04-28 10:14:11,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {1189#false} ~cond := #in~cond; {1189#false} is VALID [2022-04-28 10:14:11,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1189#false} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 10:14:11,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 10:14:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:11,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:11,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064412728] [2022-04-28 10:14:11,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064412728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:11,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596060538] [2022-04-28 10:14:11,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:11,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:11,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:14:11,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:11,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:11,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:14:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:11,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:11,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 10:14:11,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#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(18, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 10:14:11,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 10:14:11,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #41#return; {1188#true} is VALID [2022-04-28 10:14:11,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 10:14:11,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} ~x~0 := 0; {1193#(= main_~x~0 0)} is VALID [2022-04-28 10:14:11,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {1193#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1193#(= main_~x~0 0)} is VALID [2022-04-28 10:14:11,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:11,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:11,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {1194#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:11,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:11,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:11,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:11,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {1196#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:11,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:11,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1248#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:11,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {1248#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 100000000); {1248#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:11,368 INFO L272 TraceCheckUtils]: 17: Hoare triple {1248#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:11,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:11,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {1259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 10:14:11,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 10:14:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:11,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:11,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 10:14:11,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {1259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 10:14:11,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:11,501 INFO L272 TraceCheckUtils]: 17: Hoare triple {1275#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:11,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {1275#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {1275#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1288#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {1288#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1288#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:11,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1275#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1288#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:11,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {1275#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1288#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1288#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:11,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {1275#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1288#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:11,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {1275#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} ~x~0 := 0; {1275#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:11,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 10:14:11,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #41#return; {1188#true} is VALID [2022-04-28 10:14:11,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 10:14:11,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#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(18, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 10:14:11,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 10:14:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:14:11,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596060538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:11,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:11,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 14 [2022-04-28 10:14:11,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:11,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427994336] [2022-04-28 10:14:11,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427994336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:11,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:11,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:14:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709664952] [2022-04-28 10:14:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:11,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:14:11,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:11,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,523 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-28 10:14:11,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:14:11,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:11,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:14:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:14:11,524 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:11,679 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 10:14:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:14:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:14:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 10:14:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 10:14:11,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-28 10:14:11,703 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-28 10:14:11,704 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:14:11,704 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:14:11,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:14:11,704 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:11,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:14:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 10:14:11,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:11,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,725 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,725 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:11,725 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 10:14:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 10:14:11,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:11,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:11,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:14:11,726 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:14:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:11,727 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 10:14:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 10:14:11,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:11,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:11,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:11,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 10:14:11,728 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2022-04-28 10:14:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:11,728 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 10:14:11,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:11,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 10:14:11,752 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-28 10:14:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 10:14:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:14:11,752 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:11,752 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:11,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:11,956 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2118192751, now seen corresponding path program 5 times [2022-04-28 10:14:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121406840] [2022-04-28 10:14:11,963 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:11,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2118192751, now seen corresponding path program 6 times [2022-04-28 10:14:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:11,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157118931] [2022-04-28 10:14:11,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:11,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:12,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {1511#(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(18, 2);call #Ultimate.allocInit(12, 3); {1500#true} is VALID [2022-04-28 10:14:12,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {1500#true} assume true; {1500#true} is VALID [2022-04-28 10:14:12,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1500#true} {1500#true} #41#return; {1500#true} is VALID [2022-04-28 10:14:12,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:12,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {1511#(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(18, 2);call #Ultimate.allocInit(12, 3); {1500#true} is VALID [2022-04-28 10:14:12,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2022-04-28 10:14:12,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #41#return; {1500#true} is VALID [2022-04-28 10:14:12,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {1500#true} call #t~ret5 := main(); {1500#true} is VALID [2022-04-28 10:14:12,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {1500#true} ~x~0 := 0; {1505#(= main_~x~0 0)} is VALID [2022-04-28 10:14:12,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {1505#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1505#(= main_~x~0 0)} is VALID [2022-04-28 10:14:12,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:12,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:12,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:12,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:12,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:12,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:12,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:12,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:12,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1510#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:12,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {1510#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1510#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:12,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {1510#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1501#false} is VALID [2022-04-28 10:14:12,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#false} assume !(~x~0 % 4294967296 < 100000000); {1501#false} is VALID [2022-04-28 10:14:12,089 INFO L272 TraceCheckUtils]: 19: Hoare triple {1501#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1501#false} is VALID [2022-04-28 10:14:12,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#false} ~cond := #in~cond; {1501#false} is VALID [2022-04-28 10:14:12,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#false} assume 0 == ~cond; {1501#false} is VALID [2022-04-28 10:14:12,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2022-04-28 10:14:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:12,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:12,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157118931] [2022-04-28 10:14:12,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157118931] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:12,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689567192] [2022-04-28 10:14:12,090 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:12,091 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-28 10:14:12,105 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-28 10:14:12,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:14:12,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:12,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:14:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:12,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:12,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2022-04-28 10:14:12,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {1500#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(18, 2);call #Ultimate.allocInit(12, 3); {1500#true} is VALID [2022-04-28 10:14:12,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2022-04-28 10:14:12,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #41#return; {1500#true} is VALID [2022-04-28 10:14:12,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {1500#true} call #t~ret5 := main(); {1500#true} is VALID [2022-04-28 10:14:12,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {1500#true} ~x~0 := 0; {1505#(= main_~x~0 0)} is VALID [2022-04-28 10:14:12,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {1505#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1505#(= main_~x~0 0)} is VALID [2022-04-28 10:14:12,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:12,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:12,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {1506#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:12,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:12,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {1507#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:12,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:12,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {1508#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:12,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:12,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {1509#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:12,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:12,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {1560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1567#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 10:14:12,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {1567#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {1501#false} is VALID [2022-04-28 10:14:12,411 INFO L272 TraceCheckUtils]: 19: Hoare triple {1501#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1501#false} is VALID [2022-04-28 10:14:12,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#false} ~cond := #in~cond; {1501#false} is VALID [2022-04-28 10:14:12,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#false} assume 0 == ~cond; {1501#false} is VALID [2022-04-28 10:14:12,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2022-04-28 10:14:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:12,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:12,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2022-04-28 10:14:12,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#false} assume 0 == ~cond; {1501#false} is VALID [2022-04-28 10:14:12,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#false} ~cond := #in~cond; {1501#false} is VALID [2022-04-28 10:14:12,579 INFO L272 TraceCheckUtils]: 19: Hoare triple {1501#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1501#false} is VALID [2022-04-28 10:14:12,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {1595#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {1501#false} is VALID [2022-04-28 10:14:12,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {1599#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1595#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {1599#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1599#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {1606#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1599#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {1606#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1606#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {1613#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1606#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1613#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1613#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1620#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1613#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1620#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {1627#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1620#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {1627#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1627#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {1634#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1627#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {1634#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {1634#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {1500#true} ~x~0 := 0; {1634#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:12,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {1500#true} call #t~ret5 := main(); {1500#true} is VALID [2022-04-28 10:14:12,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #41#return; {1500#true} is VALID [2022-04-28 10:14:12,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2022-04-28 10:14:12,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {1500#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(18, 2);call #Ultimate.allocInit(12, 3); {1500#true} is VALID [2022-04-28 10:14:12,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2022-04-28 10:14:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:12,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689567192] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:12,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:12,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-04-28 10:14:12,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:12,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121406840] [2022-04-28 10:14:12,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121406840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:12,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:12,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:14:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147886981] [2022-04-28 10:14:12,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:12,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:14:12,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:12,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:12,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:14:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:14:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:14:12,606 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:12,809 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 10:14:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:14:12,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:14:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 10:14:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 10:14:12,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-28 10:14:12,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:12,836 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:14:12,836 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:14:12,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:14:12,836 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:12,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:14:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:14:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 10:14:12,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:12,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,858 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,859 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:12,859 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-28 10:14:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 10:14:12,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:12,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:12,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:14:12,860 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:14:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:12,861 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-28 10:14:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 10:14:12,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:12,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:12,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:12,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-28 10:14:12,862 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2022-04-28 10:14:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:12,862 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-28 10:14:12,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-28 10:14:12,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 10:14:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:14:12,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:12,886 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:12,892 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-28 10:14:13,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:13,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1681119820, now seen corresponding path program 7 times [2022-04-28 10:14:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:13,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669347914] [2022-04-28 10:14:13,093 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:13,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1681119820, now seen corresponding path program 8 times [2022-04-28 10:14:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:13,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904684610] [2022-04-28 10:14:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:13,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {1854#(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(18, 2);call #Ultimate.allocInit(12, 3); {1842#true} is VALID [2022-04-28 10:14:13,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 10:14:13,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1842#true} {1842#true} #41#return; {1842#true} is VALID [2022-04-28 10:14:13,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {1842#true} call ULTIMATE.init(); {1854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:13,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {1854#(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(18, 2);call #Ultimate.allocInit(12, 3); {1842#true} is VALID [2022-04-28 10:14:13,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 10:14:13,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #41#return; {1842#true} is VALID [2022-04-28 10:14:13,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {1842#true} call #t~ret5 := main(); {1842#true} is VALID [2022-04-28 10:14:13,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1842#true} ~x~0 := 0; {1847#(= main_~x~0 0)} is VALID [2022-04-28 10:14:13,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1847#(= main_~x~0 0)} is VALID [2022-04-28 10:14:13,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:13,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:13,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:13,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:13,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:13,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:13,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:13,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:13,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:13,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:13,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1853#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:13,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {1853#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {1853#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:13,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {1853#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1843#false} is VALID [2022-04-28 10:14:13,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {1843#false} assume !(~x~0 % 4294967296 < 100000000); {1843#false} is VALID [2022-04-28 10:14:13,223 INFO L272 TraceCheckUtils]: 21: Hoare triple {1843#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1843#false} is VALID [2022-04-28 10:14:13,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {1843#false} ~cond := #in~cond; {1843#false} is VALID [2022-04-28 10:14:13,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {1843#false} assume 0 == ~cond; {1843#false} is VALID [2022-04-28 10:14:13,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2022-04-28 10:14:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:13,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904684610] [2022-04-28 10:14:13,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904684610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:13,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438239078] [2022-04-28 10:14:13,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:13,242 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-28 10:14:13,242 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-28 10:14:13,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:13,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:13,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:14:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:13,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:13,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {1842#true} call ULTIMATE.init(); {1842#true} is VALID [2022-04-28 10:14:13,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#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(18, 2);call #Ultimate.allocInit(12, 3); {1842#true} is VALID [2022-04-28 10:14:13,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 10:14:13,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #41#return; {1842#true} is VALID [2022-04-28 10:14:13,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {1842#true} call #t~ret5 := main(); {1842#true} is VALID [2022-04-28 10:14:13,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {1842#true} ~x~0 := 0; {1847#(= main_~x~0 0)} is VALID [2022-04-28 10:14:13,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1847#(= main_~x~0 0)} is VALID [2022-04-28 10:14:13,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:13,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:13,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {1848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:13,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:13,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {1849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:13,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:13,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {1850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:13,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:13,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {1851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:13,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:13,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {1852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1909#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:13,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {1909#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {1909#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:13,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {1909#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 10:14:13,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {1916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {1916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 10:14:13,562 INFO L272 TraceCheckUtils]: 21: Hoare triple {1916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:13,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {1923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:13,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {1927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1843#false} is VALID [2022-04-28 10:14:13,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2022-04-28 10:14:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:13,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:13,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2022-04-28 10:14:13,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {1927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1843#false} is VALID [2022-04-28 10:14:13,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {1923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:13,675 INFO L272 TraceCheckUtils]: 21: Hoare triple {1943#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:13,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {1956#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {1956#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1956#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:13,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1956#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:13,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {1956#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {1956#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1956#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:13,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1956#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:13,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {1956#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1956#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1956#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:13,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1956#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 10:14:13,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {1943#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {1842#true} ~x~0 := 0; {1943#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:13,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {1842#true} call #t~ret5 := main(); {1842#true} is VALID [2022-04-28 10:14:13,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #41#return; {1842#true} is VALID [2022-04-28 10:14:13,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 10:14:13,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#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(18, 2);call #Ultimate.allocInit(12, 3); {1842#true} is VALID [2022-04-28 10:14:13,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {1842#true} call ULTIMATE.init(); {1842#true} is VALID [2022-04-28 10:14:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:14:13,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438239078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:13,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:13,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 6] total 16 [2022-04-28 10:14:13,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:13,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669347914] [2022-04-28 10:14:13,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669347914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:13,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:13,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:14:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044518408] [2022-04-28 10:14:13,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:14:13,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:13,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:13,700 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-28 10:14:13,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:14:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:13,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:14:13,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:14:13,701 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:13,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:13,953 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 10:14:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:14:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:14:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 10:14:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 10:14:13,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-28 10:14:13,981 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-28 10:14:13,981 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:14:13,981 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:14:13,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:14:13,982 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:13,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 29 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:14:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:14:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 10:14:14,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:14,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:14,007 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:14,007 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:14,008 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-28 10:14:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 10:14:14,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:14,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:14,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:14:14,008 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:14:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:14,009 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-28 10:14:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 10:14:14,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:14,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:14,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:14,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-28 10:14:14,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2022-04-28 10:14:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:14,010 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-28 10:14:14,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:14,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-28 10:14:14,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 10:14:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:14:14,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:14,035 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:14,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 10:14:14,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:14,236 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1734139159, now seen corresponding path program 9 times [2022-04-28 10:14:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:14,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184323333] [2022-04-28 10:14:14,242 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:14,242 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1734139159, now seen corresponding path program 10 times [2022-04-28 10:14:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:14,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526829371] [2022-04-28 10:14:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:14,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {2221#(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(18, 2);call #Ultimate.allocInit(12, 3); {2208#true} is VALID [2022-04-28 10:14:14,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {2208#true} assume true; {2208#true} is VALID [2022-04-28 10:14:14,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2208#true} {2208#true} #41#return; {2208#true} is VALID [2022-04-28 10:14:14,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:14,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {2221#(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(18, 2);call #Ultimate.allocInit(12, 3); {2208#true} is VALID [2022-04-28 10:14:14,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID [2022-04-28 10:14:14,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2208#true} #41#return; {2208#true} is VALID [2022-04-28 10:14:14,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#true} call #t~ret5 := main(); {2208#true} is VALID [2022-04-28 10:14:14,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {2208#true} ~x~0 := 0; {2213#(= main_~x~0 0)} is VALID [2022-04-28 10:14:14,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2213#(= main_~x~0 0)} is VALID [2022-04-28 10:14:14,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {2213#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:14,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:14,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:14,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:14,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:14,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:14,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:14,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:14,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:14,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:14,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:14,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:14,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2220#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 10:14:14,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {2220#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < 100000000); {2220#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 10:14:14,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {2220#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2209#false} is VALID [2022-04-28 10:14:14,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {2209#false} assume !(~x~0 % 4294967296 < 100000000); {2209#false} is VALID [2022-04-28 10:14:14,415 INFO L272 TraceCheckUtils]: 23: Hoare triple {2209#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2209#false} is VALID [2022-04-28 10:14:14,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {2209#false} ~cond := #in~cond; {2209#false} is VALID [2022-04-28 10:14:14,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {2209#false} assume 0 == ~cond; {2209#false} is VALID [2022-04-28 10:14:14,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {2209#false} assume !false; {2209#false} is VALID [2022-04-28 10:14:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:14,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526829371] [2022-04-28 10:14:14,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526829371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:14,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468829616] [2022-04-28 10:14:14,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:14,432 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-28 10:14:14,434 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-28 10:14:14,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:14,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:14,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:14:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:14,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:14,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2208#true} is VALID [2022-04-28 10:14:14,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {2208#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(18, 2);call #Ultimate.allocInit(12, 3); {2208#true} is VALID [2022-04-28 10:14:14,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID [2022-04-28 10:14:14,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2208#true} #41#return; {2208#true} is VALID [2022-04-28 10:14:14,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#true} call #t~ret5 := main(); {2208#true} is VALID [2022-04-28 10:14:14,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {2208#true} ~x~0 := 0; {2213#(= main_~x~0 0)} is VALID [2022-04-28 10:14:14,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2213#(= main_~x~0 0)} is VALID [2022-04-28 10:14:14,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {2213#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:14,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:14,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:14,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:14,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {2215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:14,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:14,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {2216#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:14,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:14,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:14,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:14,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {2218#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:14,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:14,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {2219#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 10:14:14,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {2282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 10:14:14,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {2282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2289#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 10:14:14,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {2289#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {2209#false} is VALID [2022-04-28 10:14:14,714 INFO L272 TraceCheckUtils]: 23: Hoare triple {2209#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2209#false} is VALID [2022-04-28 10:14:14,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {2209#false} ~cond := #in~cond; {2209#false} is VALID [2022-04-28 10:14:14,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {2209#false} assume 0 == ~cond; {2209#false} is VALID [2022-04-28 10:14:14,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {2209#false} assume !false; {2209#false} is VALID [2022-04-28 10:14:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:14,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:14,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {2209#false} assume !false; {2209#false} is VALID [2022-04-28 10:14:14,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {2209#false} assume 0 == ~cond; {2209#false} is VALID [2022-04-28 10:14:14,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {2209#false} ~cond := #in~cond; {2209#false} is VALID [2022-04-28 10:14:14,940 INFO L272 TraceCheckUtils]: 23: Hoare triple {2209#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2209#false} is VALID [2022-04-28 10:14:14,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {2317#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {2209#false} is VALID [2022-04-28 10:14:14,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {2321#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2317#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {2321#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2321#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {2328#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2321#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {2328#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2328#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {2335#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2328#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {2335#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2335#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {2342#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2335#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {2342#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2342#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {2349#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2342#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {2349#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2349#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {2356#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2349#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {2356#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2356#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {2363#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2356#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {2363#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2363#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2363#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {2370#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2370#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {2208#true} ~x~0 := 0; {2370#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-28 10:14:14,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#true} call #t~ret5 := main(); {2208#true} is VALID [2022-04-28 10:14:14,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2208#true} #41#return; {2208#true} is VALID [2022-04-28 10:14:14,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID [2022-04-28 10:14:14,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {2208#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(18, 2);call #Ultimate.allocInit(12, 3); {2208#true} is VALID [2022-04-28 10:14:14,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2208#true} is VALID [2022-04-28 10:14:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:14,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468829616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:14,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:14,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-28 10:14:14,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:14,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184323333] [2022-04-28 10:14:14,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184323333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:14,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:14,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:14:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116104992] [2022-04-28 10:14:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:14,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:14:14,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:14,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:14,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:14,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:14:14,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:14,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:14:14,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:14:14,971 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,353 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 10:14:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:14:15,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:14:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-28 10:14:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-28 10:14:15,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-28 10:14:15,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:15,389 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:14:15,389 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:14:15,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:14:15,390 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:15,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 44 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:14:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:14:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 10:14:15,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:15,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,426 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,428 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,430 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 10:14:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 10:14:15,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:14:15,430 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:14:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,431 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 10:14:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 10:14:15,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:15,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-28 10:14:15,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2022-04-28 10:14:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:15,432 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-28 10:14:15,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2022-04-28 10:14:15,463 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-28 10:14:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 10:14:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:14:15,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:15,466 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:15,484 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-28 10:14:15,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:14:15,682 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1851963462, now seen corresponding path program 11 times [2022-04-28 10:14:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:15,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363858276] [2022-04-28 10:14:15,688 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:15,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:15,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1851963462, now seen corresponding path program 12 times [2022-04-28 10:14:15,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:15,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292910026] [2022-04-28 10:14:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:15,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:15,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {2620#(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(18, 2);call #Ultimate.allocInit(12, 3); {2606#true} is VALID [2022-04-28 10:14:15,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {2606#true} assume true; {2606#true} is VALID [2022-04-28 10:14:15,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2606#true} {2606#true} #41#return; {2606#true} is VALID [2022-04-28 10:14:15,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {2606#true} call ULTIMATE.init(); {2620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:15,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {2620#(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(18, 2);call #Ultimate.allocInit(12, 3); {2606#true} is VALID [2022-04-28 10:14:15,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {2606#true} assume true; {2606#true} is VALID [2022-04-28 10:14:15,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2606#true} {2606#true} #41#return; {2606#true} is VALID [2022-04-28 10:14:15,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {2606#true} call #t~ret5 := main(); {2606#true} is VALID [2022-04-28 10:14:15,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {2606#true} ~x~0 := 0; {2611#(= main_~x~0 0)} is VALID [2022-04-28 10:14:15,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {2611#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2611#(= main_~x~0 0)} is VALID [2022-04-28 10:14:15,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {2611#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:15,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {2612#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2612#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 10:14:15,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {2612#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2613#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:15,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {2613#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2613#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 10:14:15,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {2613#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2614#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:15,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {2614#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2614#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 10:14:15,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2615#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:15,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {2615#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2615#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 10:14:15,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {2615#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2616#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:15,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {2616#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2616#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 10:14:15,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {2616#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2617#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:15,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {2617#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2617#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 10:14:15,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {2617#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2618#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 10:14:15,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2618#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 10:14:15,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {2618#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2619#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:14:15,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {2619#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {2619#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:14:15,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {2619#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2607#false} is VALID [2022-04-28 10:14:15,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {2607#false} assume !(~x~0 % 4294967296 < 100000000); {2607#false} is VALID [2022-04-28 10:14:15,844 INFO L272 TraceCheckUtils]: 25: Hoare triple {2607#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2607#false} is VALID [2022-04-28 10:14:15,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {2607#false} ~cond := #in~cond; {2607#false} is VALID [2022-04-28 10:14:15,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {2607#false} assume 0 == ~cond; {2607#false} is VALID [2022-04-28 10:14:15,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {2607#false} assume !false; {2607#false} is VALID [2022-04-28 10:14:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:15,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292910026] [2022-04-28 10:14:15,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292910026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120870656] [2022-04-28 10:14:15,846 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:15,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:15,848 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-28 10:14:15,849 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-28 10:14:15,901 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:14:15,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:15,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:14:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:15,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:16,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {2606#true} call ULTIMATE.init(); {2606#true} is VALID [2022-04-28 10:14:16,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {2606#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(18, 2);call #Ultimate.allocInit(12, 3); {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {2606#true} assume true; {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2606#true} {2606#true} #41#return; {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {2606#true} call #t~ret5 := main(); {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {2606#true} ~x~0 := 0; {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:16,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:16,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:16,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:16,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2687#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-28 10:14:16,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {2687#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {2687#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-28 10:14:16,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {2687#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2694#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-28 10:14:16,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {2694#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {2694#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-28 10:14:16,286 INFO L272 TraceCheckUtils]: 25: Hoare triple {2694#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2701#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:16,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {2701#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2705#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:16,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {2705#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2607#false} is VALID [2022-04-28 10:14:16,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {2607#false} assume !false; {2607#false} is VALID [2022-04-28 10:14:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:14:16,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:17,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {2607#false} assume !false; {2607#false} is VALID [2022-04-28 10:14:17,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {2705#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2607#false} is VALID [2022-04-28 10:14:17,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {2701#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2705#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:17,078 INFO L272 TraceCheckUtils]: 25: Hoare triple {2721#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2701#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:17,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {2721#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {2721#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:17,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {2728#(or (< (mod main_~x~0 4294967296) 10000000) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2721#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 10:14:17,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {2732#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {2728#(or (< (mod main_~x~0 4294967296) 10000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2732#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:17,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {2606#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {2606#true} assume !!(~x~0 % 4294967296 < 100000000); {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {2606#true} ~x~0 := 0; {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {2606#true} call #t~ret5 := main(); {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2606#true} {2606#true} #41#return; {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {2606#true} assume true; {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2606#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(18, 2);call #Ultimate.allocInit(12, 3); {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {2606#true} call ULTIMATE.init(); {2606#true} is VALID [2022-04-28 10:14:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:14:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120870656] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:14:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 6] total 19 [2022-04-28 10:14:17,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363858276] [2022-04-28 10:14:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363858276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:14:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872157051] [2022-04-28 10:14:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:17,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:14:17,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:17,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:17,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:17,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:14:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:14:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:14:17,094 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:17,190 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 10:14:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:14:17,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:14:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 10:14:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 10:14:17,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-28 10:14:17,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:17,205 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:14:17,206 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:14:17,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:14:17,206 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:17,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:14:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:14:17,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:17,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:17,207 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:17,207 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:17,207 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:14:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:14:17,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:17,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:17,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:14:17,208 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:14:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:17,208 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:14:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:14:17,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:17,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:17,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:17,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:14:17,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-28 10:14:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:17,208 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:14:17,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:17,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:14:17,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:14:17,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:17,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:14:17,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:17,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:17,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:14:17,513 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 10:14:17,513 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 10:14:17,513 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 10:14:17,513 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:14:17,513 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:14:17,513 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:14:17,513 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:14:17,513 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 5 18) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 5 18) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 5 18) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L895 garLoopResultBuilder]: At program point L9(lines 9 13) the Hoare annotation is: (or (< (mod main_~x~0 4294967296) 10000000) (= (mod main_~x~0 2) 0)) [2022-04-28 10:14:17,514 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 14) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000) (= (mod main_~x~0 2) 0)) [2022-04-28 10:14:17,514 INFO L895 garLoopResultBuilder]: At program point L8-2(lines 8 14) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point L4-3(line 4) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(line 4) the Hoare annotation is: true [2022-04-28 10:14:17,514 INFO L895 garLoopResultBuilder]: At program point L4(line 4) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 10:14:17,514 INFO L895 garLoopResultBuilder]: At program point L4-1(line 4) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:14:17,514 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:14:17,516 INFO L356 BasicCegarLoop]: Path program histogram: [12, 6, 2, 2] [2022-04-28 10:14:17,517 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:14:17,522 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:14:17,523 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:14:17,531 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:14:17,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:14:17 BoogieIcfgContainer [2022-04-28 10:14:17,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:14:17,543 INFO L158 Benchmark]: Toolchain (without parser) took 11354.22ms. Allocated memory was 215.0MB in the beginning and 341.8MB in the end (delta: 126.9MB). Free memory was 166.4MB in the beginning and 127.5MB in the end (delta: 38.9MB). Peak memory consumption was 166.7MB. Max. memory is 8.0GB. [2022-04-28 10:14:17,543 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory was 182.2MB in the beginning and 182.0MB in the end (delta: 137.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:14:17,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.51ms. Allocated memory is still 215.0MB. Free memory was 166.1MB in the beginning and 191.5MB in the end (delta: -25.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 10:14:17,544 INFO L158 Benchmark]: Boogie Preprocessor took 38.29ms. Allocated memory is still 215.0MB. Free memory was 191.5MB in the beginning and 189.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:14:17,544 INFO L158 Benchmark]: RCFGBuilder took 281.34ms. Allocated memory is still 215.0MB. Free memory was 189.9MB in the beginning and 179.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 10:14:17,545 INFO L158 Benchmark]: TraceAbstraction took 10804.40ms. Allocated memory was 215.0MB in the beginning and 341.8MB in the end (delta: 126.9MB). Free memory was 178.9MB in the beginning and 128.0MB in the end (delta: 50.9MB). Peak memory consumption was 179.4MB. Max. memory is 8.0GB. [2022-04-28 10:14:17,546 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.10ms. Allocated memory is still 215.0MB. Free memory was 182.2MB in the beginning and 182.0MB in the end (delta: 137.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.51ms. Allocated memory is still 215.0MB. Free memory was 166.1MB in the beginning and 191.5MB in the end (delta: -25.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.29ms. Allocated memory is still 215.0MB. Free memory was 191.5MB in the beginning and 189.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.34ms. Allocated memory is still 215.0MB. Free memory was 189.9MB in the beginning and 179.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10804.40ms. Allocated memory was 215.0MB in the beginning and 341.8MB in the end (delta: 126.9MB). Free memory was 178.9MB in the beginning and 128.0MB in the end (delta: 50.9MB). Peak memory consumption was 179.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 477 IncrementalHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 136 mSDtfsCounter, 477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 16 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=10, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 80 PreInvPairs, 126 NumberOfFragments, 65 HoareAnnotationTreeSize, 80 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 455 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 10000000 || x % 2 == 0 - ProcedureContractResult [Line: 5]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:14:17,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...