/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/in-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:07:17,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:07:17,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:07:17,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:07:17,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:07:17,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:07:17,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:07:17,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:07:17,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:07:17,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:07:17,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:07:17,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:07:17,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:07:17,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:07:17,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:07:17,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:07:17,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:07:17,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:07:17,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:07:17,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:07:17,530 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:07:17,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:07:17,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:07:17,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:07:17,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:07:17,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:07:17,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:07:17,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:07:17,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:07:17,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:07:17,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:07:17,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:07:17,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:07:17,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:07:17,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:07:17,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:07:17,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:07:17,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:07:17,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:07:17,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:07:17,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:07:17,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:07:17,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:07:17,552 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:07:17,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:07:17,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:07:17,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:07:17,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:07:17,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:07:17,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:07:17,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:07:17,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:07:17,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:07:17,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:07:17,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:07:17,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:07:17,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:07:17,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:07:17,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:07:17,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:07:17,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:07:17,556 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:07:17,556 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:07:17,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:07:17,556 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:07:17,556 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:07:17,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:07:17,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:07:17,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:07:17,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:07:17,781 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:07:17,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-08 10:07:17,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c43bc742/e45ff7555126459d965cbdc1f17a29f6/FLAG74846f0d3 [2022-04-08 10:07:18,158 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:07:18,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-08 10:07:18,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c43bc742/e45ff7555126459d965cbdc1f17a29f6/FLAG74846f0d3 [2022-04-08 10:07:18,173 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c43bc742/e45ff7555126459d965cbdc1f17a29f6 [2022-04-08 10:07:18,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:07:18,175 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:07:18,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:07:18,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:07:18,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:07:18,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454833e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18, skipping insertion in model container [2022-04-08 10:07:18,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:07:18,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:07:18,297 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/in-de61.c[368,381] [2022-04-08 10:07:18,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:07:18,328 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:07:18,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/in-de61.c[368,381] [2022-04-08 10:07:18,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:07:18,348 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:07:18,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18 WrapperNode [2022-04-08 10:07:18,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:07:18,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:07:18,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:07:18,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:07:18,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:07:18,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:07:18,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:07:18,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:07:18,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (1/1) ... [2022-04-08 10:07:18,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:07:18,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:18,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:07:18,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:07:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:07:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:07:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:07:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:07:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:07:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:07:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:07:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:07:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:07:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:07:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:07:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:07:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:07:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:07:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:07:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:07:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:07:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:07:18,464 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:07:18,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:07:18,584 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:07:18,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:07:18,589 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-08 10:07:18,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:07:18 BoogieIcfgContainer [2022-04-08 10:07:18,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:07:18,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:07:18,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:07:18,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:07:18,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:07:18" (1/3) ... [2022-04-08 10:07:18,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756da058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:07:18, skipping insertion in model container [2022-04-08 10:07:18,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:18" (2/3) ... [2022-04-08 10:07:18,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756da058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:07:18, skipping insertion in model container [2022-04-08 10:07:18,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:07:18" (3/3) ... [2022-04-08 10:07:18,595 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.c [2022-04-08 10:07:18,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:07:18,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:07:18,625 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:07:18,629 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:07:18,629 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:07:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:07:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:07:18,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:18,653 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:18,654 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-08 10:07:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:18,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1626939371] [2022-04-08 10:07:18,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:07:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-08 10:07:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:18,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573634313] [2022-04-08 10:07:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:18,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-08 10:07:18,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 10:07:18,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-08 10:07:18,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:18,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-08 10:07:18,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 10:07:18,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-08 10:07:18,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-08 10:07:18,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-08 10:07:18,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-08 10:07:18,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-08 10:07:18,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-08 10:07:18,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-08 10:07:18,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-08 10:07:18,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-08 10:07:18,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-08 10:07:18,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-08 10:07:18,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-08 10:07:18,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-08 10:07:18,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 10:07:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573634313] [2022-04-08 10:07:18,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573634313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:18,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:07:18,831 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:18,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1626939371] [2022-04-08 10:07:18,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1626939371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:18,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:18,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:07:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100386581] [2022-04-08 10:07:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:07:18,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:18,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:18,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:07:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:18,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:07:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:07:18,873 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:18,933 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-08 10:07:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:07:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:07:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 10:07:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 10:07:18,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-08 10:07:19,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,011 INFO L225 Difference]: With dead ends: 43 [2022-04-08 10:07:19,012 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 10:07:19,014 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:07:19,017 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:19,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:07:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 10:07:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 10:07:19,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:19,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,040 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,041 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,042 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-08 10:07:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-08 10:07:19,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-08 10:07:19,043 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-08 10:07:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,045 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-08 10:07:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-08 10:07:19,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:19,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-08 10:07:19,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-08 10:07:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:19,048 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-08 10:07:19,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-08 10:07:19,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-08 10:07:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:07:19,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:19,070 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:19,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:07:19,071 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-08 10:07:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [111018446] [2022-04-08 10:07:19,073 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:07:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-08 10:07:19,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:19,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585140824] [2022-04-08 10:07:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:19,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-08 10:07:19,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-08 10:07:19,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-08 10:07:19,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:19,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-08 10:07:19,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-08 10:07:19,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-08 10:07:19,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-08 10:07:19,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:07:19,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-08 10:07:19,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:07:19,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:07:19,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:07:19,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:07:19,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:07:19,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:07:19,493 INFO L272 TraceCheckUtils]: 13: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {203#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:07:19,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {203#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:07:19,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-08 10:07:19,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-08 10:07:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:19,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585140824] [2022-04-08 10:07:19,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585140824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:19,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:19,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:07:19,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:19,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [111018446] [2022-04-08 10:07:19,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [111018446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:19,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:19,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:07:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145591729] [2022-04-08 10:07:19,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:07:19,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:19,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:07:19,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:19,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:07:19,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:07:19,518 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,857 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-08 10:07:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:07:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:07:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-08 10:07:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-08 10:07:19,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-08 10:07:19,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,917 INFO L225 Difference]: With dead ends: 38 [2022-04-08 10:07:19,917 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:07:19,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:07:19,918 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:19,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 46 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:07:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 10:07:19,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:19,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,922 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,922 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,924 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-08 10:07:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-08 10:07:19,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 10:07:19,924 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 10:07:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,925 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-08 10:07:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-08 10:07:19,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:19,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-08 10:07:19,927 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-04-08 10:07:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:19,927 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-08 10:07:19,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:19,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-08 10:07:19,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-08 10:07:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:07:19,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:19,947 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:19,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:07:19,947 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 1 times [2022-04-08 10:07:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:19,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1296066371] [2022-04-08 10:07:19,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:19,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 2 times [2022-04-08 10:07:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:19,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698081972] [2022-04-08 10:07:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:20,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-08 10:07:20,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-08 10:07:20,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-08 10:07:20,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:20,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-08 10:07:20,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-08 10:07:20,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-08 10:07:20,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-08 10:07:20,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {375#(= main_~y~0 0)} is VALID [2022-04-08 10:07:20,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:20,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:20,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {377#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:20,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !(~x~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#false} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,106 INFO L272 TraceCheckUtils]: 14: Hoare triple {371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {371#false} is VALID [2022-04-08 10:07:20,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#false} ~cond := #in~cond; {371#false} is VALID [2022-04-08 10:07:20,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {371#false} assume 0 == ~cond; {371#false} is VALID [2022-04-08 10:07:20,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-08 10:07:20,107 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-08 10:07:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:20,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698081972] [2022-04-08 10:07:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698081972] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218174798] [2022-04-08 10:07:20,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:20,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:20,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:20,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:20,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:07:20,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:20,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:20,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:07:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:20,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:20,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-08 10:07:20,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-08 10:07:20,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-08 10:07:20,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-08 10:07:20,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-08 10:07:20,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {375#(= main_~y~0 0)} is VALID [2022-04-08 10:07:20,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:20,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:20,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:20,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !(~x~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#false} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,332 INFO L272 TraceCheckUtils]: 14: Hoare triple {371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {371#false} is VALID [2022-04-08 10:07:20,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#false} ~cond := #in~cond; {371#false} is VALID [2022-04-08 10:07:20,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {371#false} assume 0 == ~cond; {371#false} is VALID [2022-04-08 10:07:20,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-08 10:07:20,333 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-08 10:07:20,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:20,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-08 10:07:20,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {371#false} assume 0 == ~cond; {371#false} is VALID [2022-04-08 10:07:20,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#false} ~cond := #in~cond; {371#false} is VALID [2022-04-08 10:07:20,414 INFO L272 TraceCheckUtils]: 14: Hoare triple {371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {371#false} is VALID [2022-04-08 10:07:20,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#false} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !(~x~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#false} assume !(~y~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {371#false} is VALID [2022-04-08 10:07:20,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {458#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:20,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {462#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:20,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {462#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:20,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {469#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:20,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-08 10:07:20,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-08 10:07:20,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-08 10:07:20,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-08 10:07:20,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-08 10:07:20,419 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-08 10:07:20,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218174798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:20,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:20,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 10:07:20,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:20,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1296066371] [2022-04-08 10:07:20,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1296066371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:20,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:20,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:07:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126698132] [2022-04-08 10:07:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:20,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:07:20,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:20,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:20,433 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:07:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:07:20,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:07:20,435 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:20,695 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-08 10:07:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:07:20,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:07:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-08 10:07:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-08 10:07:20,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-08 10:07:20,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:20,750 INFO L225 Difference]: With dead ends: 41 [2022-04-08 10:07:20,751 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:07:20,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:07:20,753 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:20,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:07:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-08 10:07:20,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:20,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,777 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,779 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:20,781 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-08 10:07:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 10:07:20,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:20,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:20,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:07:20,783 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:07:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:20,789 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-08 10:07:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 10:07:20,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:20,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:20,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:20,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-04-08 10:07:20,793 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 18 [2022-04-08 10:07:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:20,793 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-04-08 10:07:20,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:20,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 42 transitions. [2022-04-08 10:07:20,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-08 10:07:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:07:20,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:20,824 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:20,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:21,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:21,041 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash -752421319, now seen corresponding path program 3 times [2022-04-08 10:07:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:21,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [80440283] [2022-04-08 10:07:21,045 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:21,045 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -752421319, now seen corresponding path program 4 times [2022-04-08 10:07:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:21,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382230935] [2022-04-08 10:07:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-08 10:07:21,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-08 10:07:21,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-08 10:07:21,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:21,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-08 10:07:21,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-08 10:07:21,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-08 10:07:21,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret17 := main(); {704#true} is VALID [2022-04-08 10:07:21,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {709#(= main_~y~0 0)} is VALID [2022-04-08 10:07:21,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {710#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:21,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {710#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {712#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:21,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {712#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#false} assume !(~x~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,117 INFO L272 TraceCheckUtils]: 15: Hoare triple {705#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {705#false} is VALID [2022-04-08 10:07:21,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} ~cond := #in~cond; {705#false} is VALID [2022-04-08 10:07:21,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume 0 == ~cond; {705#false} is VALID [2022-04-08 10:07:21,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-08 10:07:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382230935] [2022-04-08 10:07:21,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382230935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556086675] [2022-04-08 10:07:21,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:21,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:21,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:21,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:07:21,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:21,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:21,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:07:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:21,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {704#true} is VALID [2022-04-08 10:07:21,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-08 10:07:21,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-08 10:07:21,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-08 10:07:21,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret17 := main(); {704#true} is VALID [2022-04-08 10:07:21,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {709#(= main_~y~0 0)} is VALID [2022-04-08 10:07:21,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {710#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:21,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {710#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {744#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:21,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#false} assume !(~x~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,356 INFO L272 TraceCheckUtils]: 15: Hoare triple {705#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {705#false} is VALID [2022-04-08 10:07:21,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} ~cond := #in~cond; {705#false} is VALID [2022-04-08 10:07:21,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume 0 == ~cond; {705#false} is VALID [2022-04-08 10:07:21,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-08 10:07:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:21,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:21,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-08 10:07:21,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume 0 == ~cond; {705#false} is VALID [2022-04-08 10:07:21,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} ~cond := #in~cond; {705#false} is VALID [2022-04-08 10:07:21,476 INFO L272 TraceCheckUtils]: 15: Hoare triple {705#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {705#false} is VALID [2022-04-08 10:07:21,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#false} assume !(~x~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {705#false} is VALID [2022-04-08 10:07:21,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {796#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:21,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:21,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {807#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:21,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {811#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {807#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:21,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {811#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:21,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret17 := main(); {704#true} is VALID [2022-04-08 10:07:21,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #94#return; {704#true} is VALID [2022-04-08 10:07:21,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-08 10:07:21,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-08 10:07:21,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {704#true} is VALID [2022-04-08 10:07:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:21,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556086675] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:21,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:21,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 10:07:21,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:21,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [80440283] [2022-04-08 10:07:21,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [80440283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:21,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:21,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:07:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799146447] [2022-04-08 10:07:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:21,481 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-08 10:07:21,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:21,481 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-08 10:07:21,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:21,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:07:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:07:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:07:21,503 INFO L87 Difference]: Start difference. First operand 31 states and 42 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-08 10:07:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:21,762 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2022-04-08 10:07:21,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:07:21,762 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-08 10:07:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:21,763 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-08 10:07:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 10:07:21,764 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-08 10:07:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-08 10:07:21,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-08 10:07:21,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:21,814 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:07:21,814 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 10:07:21,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:07:21,814 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:21,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 47 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 10:07:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-04-08 10:07:21,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:21,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:21,836 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:21,837 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:21,838 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-08 10:07:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-08 10:07:21,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:21,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:21,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 10:07:21,839 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 10:07:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:21,840 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-04-08 10:07:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-08 10:07:21,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:21,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:21,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:21,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-04-08 10:07:21,842 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 19 [2022-04-08 10:07:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:21,842 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-04-08 10:07:21,842 INFO L479 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-08 10:07:21,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 54 transitions. [2022-04-08 10:07:21,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 10:07:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:07:21,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:21,908 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:21,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:22,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 10:07:22,122 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:22,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 1 times [2022-04-08 10:07:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:22,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978413229] [2022-04-08 10:07:22,126 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:22,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 2 times [2022-04-08 10:07:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:22,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531287547] [2022-04-08 10:07:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:22,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-08 10:07:22,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-08 10:07:22,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-08 10:07:22,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:22,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-08 10:07:22,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-08 10:07:22,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-08 10:07:22,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2022-04-08 10:07:22,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1133#(= main_~y~0 0)} is VALID [2022-04-08 10:07:22,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:22,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:22,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1134#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1135#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:22,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {1135#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1136#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:22,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {1136#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1136#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:22,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {1136#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:22,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:22,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:22,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {1137#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {1129#false} assume !(~y~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,207 INFO L272 TraceCheckUtils]: 16: Hoare triple {1129#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1129#false} is VALID [2022-04-08 10:07:22,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-08 10:07:22,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-08 10:07:22,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-08 10:07:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:22,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:22,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531287547] [2022-04-08 10:07:22,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531287547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:22,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055250145] [2022-04-08 10:07:22,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:22,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:22,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:22,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:22,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 10:07:22,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:22,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:22,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:07:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:22,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:22,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2022-04-08 10:07:22,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-08 10:07:22,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-08 10:07:22,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-08 10:07:22,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2022-04-08 10:07:22,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1128#true} is VALID [2022-04-08 10:07:22,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {1128#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#false} assume !(~z~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {1129#false} assume !(~y~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,326 INFO L272 TraceCheckUtils]: 16: Hoare triple {1129#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1129#false} is VALID [2022-04-08 10:07:22,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-08 10:07:22,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-08 10:07:22,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-08 10:07:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:07:22,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:22,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-08 10:07:22,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-08 10:07:22,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-08 10:07:22,387 INFO L272 TraceCheckUtils]: 16: Hoare triple {1129#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1129#false} is VALID [2022-04-08 10:07:22,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {1129#false} assume !(~y~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#false} assume !(~z~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1129#false} is VALID [2022-04-08 10:07:22,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {1170#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1170#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:22,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1128#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1160#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1128#true} is VALID [2022-04-08 10:07:22,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret17 := main(); {1128#true} is VALID [2022-04-08 10:07:22,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #94#return; {1128#true} is VALID [2022-04-08 10:07:22,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-08 10:07:22,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1128#true} is VALID [2022-04-08 10:07:22,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2022-04-08 10:07:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:07:22,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055250145] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:22,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:22,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-08 10:07:22,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:22,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978413229] [2022-04-08 10:07:22,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978413229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:22,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:22,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:07:22,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620205370] [2022-04-08 10:07:22,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:22,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:07:22,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:22,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:22,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:07:22,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:22,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:07:22,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:07:22,409 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:22,800 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2022-04-08 10:07:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:07:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:07:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2022-04-08 10:07:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2022-04-08 10:07:22,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 78 transitions. [2022-04-08 10:07:22,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:22,857 INFO L225 Difference]: With dead ends: 87 [2022-04-08 10:07:22,857 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 10:07:22,858 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:07:22,858 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:22,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 10:07:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-04-08 10:07:22,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:22,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,909 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,909 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:22,911 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-08 10:07:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-08 10:07:22,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:22,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:22,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 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 67 states. [2022-04-08 10:07:22,912 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 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 67 states. [2022-04-08 10:07:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:22,913 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-08 10:07:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-08 10:07:22,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:22,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:22,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:22,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-04-08 10:07:22,915 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 20 [2022-04-08 10:07:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:22,915 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-04-08 10:07:22,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:22,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 71 transitions. [2022-04-08 10:07:22,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-08 10:07:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:07:22,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:22,974 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:22,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:23,189 WARN L460 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-08 10:07:23,190 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1176104790, now seen corresponding path program 5 times [2022-04-08 10:07:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:23,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1333379513] [2022-04-08 10:07:23,193 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:23,193 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1176104790, now seen corresponding path program 6 times [2022-04-08 10:07:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:23,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253738981] [2022-04-08 10:07:23,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:23,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:23,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-08 10:07:23,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 10:07:23,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-08 10:07:23,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:23,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-08 10:07:23,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 10:07:23,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-08 10:07:23,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret17 := main(); {1692#true} is VALID [2022-04-08 10:07:23,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1697#(= main_~y~0 0)} is VALID [2022-04-08 10:07:23,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {1697#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:23,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {1698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:23,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {1699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:23,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:23,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1701#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:23,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {1701#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {1693#false} assume !(~x~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {1693#false} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L272 TraceCheckUtils]: 16: Hoare triple {1693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1693#false} assume 0 == ~cond; {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-08 10:07:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:23,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253738981] [2022-04-08 10:07:23,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253738981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:23,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817307575] [2022-04-08 10:07:23,266 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:23,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:23,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 10:07:23,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:23,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:23,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:07:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:23,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:23,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-08 10:07:23,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-08 10:07:23,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 10:07:23,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-08 10:07:23,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret17 := main(); {1692#true} is VALID [2022-04-08 10:07:23,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1697#(= main_~y~0 0)} is VALID [2022-04-08 10:07:23,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {1697#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:23,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {1698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:23,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:23,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:23,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1736#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:23,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {1736#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {1693#false} assume !(~x~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {1693#false} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,476 INFO L272 TraceCheckUtils]: 16: Hoare triple {1693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1693#false} is VALID [2022-04-08 10:07:23,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2022-04-08 10:07:23,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {1693#false} assume 0 == ~cond; {1693#false} is VALID [2022-04-08 10:07:23,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-08 10:07:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:23,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:23,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-08 10:07:23,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {1693#false} assume 0 == ~cond; {1693#false} is VALID [2022-04-08 10:07:23,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2022-04-08 10:07:23,575 INFO L272 TraceCheckUtils]: 16: Hoare triple {1693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1693#false} is VALID [2022-04-08 10:07:23,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {1693#false} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {1693#false} assume !(~x~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {1693#false} assume !(~y~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {1788#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1693#false} is VALID [2022-04-08 10:07:23,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {1792#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1788#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:23,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1792#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:23,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {1799#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1792#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:23,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {1803#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1799#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:23,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {1807#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1803#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:23,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1807#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:23,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret17 := main(); {1692#true} is VALID [2022-04-08 10:07:23,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #94#return; {1692#true} is VALID [2022-04-08 10:07:23,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 10:07:23,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-08 10:07:23,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-08 10:07:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:23,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817307575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:23,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:23,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 10:07:23,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:23,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1333379513] [2022-04-08 10:07:23,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1333379513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:23,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:23,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:07:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619361098] [2022-04-08 10:07:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:07:23,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:23,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:23,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:23,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:07:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:07:23,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:07:23,596 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:24,107 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2022-04-08 10:07:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:07:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:07:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-04-08 10:07:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-04-08 10:07:24,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 86 transitions. [2022-04-08 10:07:24,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:24,173 INFO L225 Difference]: With dead ends: 86 [2022-04-08 10:07:24,173 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 10:07:24,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:07:24,174 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 61 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:24,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 58 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:07:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 10:07:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2022-04-08 10:07:24,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:24,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,246 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,246 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:24,248 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2022-04-08 10:07:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2022-04-08 10:07:24,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:24,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:24,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 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 77 states. [2022-04-08 10:07:24,249 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 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 77 states. [2022-04-08 10:07:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:24,250 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2022-04-08 10:07:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2022-04-08 10:07:24,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:24,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:24,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:24,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2022-04-08 10:07:24,252 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 20 [2022-04-08 10:07:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:24,252 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2022-04-08 10:07:24,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:24,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 87 transitions. [2022-04-08 10:07:24,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2022-04-08 10:07:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:07:24,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:24,321 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:24,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 10:07:24,535 WARN L460 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-08 10:07:24,536 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-04-08 10:07:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:24,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393452060] [2022-04-08 10:07:24,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:24,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 2 times [2022-04-08 10:07:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:24,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297347451] [2022-04-08 10:07:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-08 10:07:24,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-08 10:07:24,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-08 10:07:24,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:24,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-08 10:07:24,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-08 10:07:24,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-08 10:07:24,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret17 := main(); {2292#true} is VALID [2022-04-08 10:07:24,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2292#true} is VALID [2022-04-08 10:07:24,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:24,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:24,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:24,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:24,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {2293#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2293#false} is VALID [2022-04-08 10:07:24,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {2293#false} assume !(~z~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:24,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {2293#false} assume !(~y~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:24,591 INFO L272 TraceCheckUtils]: 17: Hoare triple {2293#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2293#false} is VALID [2022-04-08 10:07:24,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {2293#false} ~cond := #in~cond; {2293#false} is VALID [2022-04-08 10:07:24,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {2293#false} assume 0 == ~cond; {2293#false} is VALID [2022-04-08 10:07:24,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-08 10:07:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:24,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297347451] [2022-04-08 10:07:24,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297347451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:24,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024190273] [2022-04-08 10:07:24,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:24,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:24,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:24,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:24,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 10:07:24,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:24,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:24,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:07:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:24,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:24,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2292#true} is VALID [2022-04-08 10:07:24,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-08 10:07:24,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-08 10:07:24,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-08 10:07:24,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret17 := main(); {2292#true} is VALID [2022-04-08 10:07:24,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2292#true} is VALID [2022-04-08 10:07:24,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:24,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:24,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:24,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:24,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:24,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {2293#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2293#false} is VALID [2022-04-08 10:07:24,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {2293#false} assume !(~z~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:24,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {2293#false} assume !(~y~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:24,835 INFO L272 TraceCheckUtils]: 17: Hoare triple {2293#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2293#false} is VALID [2022-04-08 10:07:24,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {2293#false} ~cond := #in~cond; {2293#false} is VALID [2022-04-08 10:07:24,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {2293#false} assume 0 == ~cond; {2293#false} is VALID [2022-04-08 10:07:24,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-08 10:07:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:24,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:25,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-08 10:07:25,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {2293#false} assume 0 == ~cond; {2293#false} is VALID [2022-04-08 10:07:25,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {2293#false} ~cond := #in~cond; {2293#false} is VALID [2022-04-08 10:07:25,008 INFO L272 TraceCheckUtils]: 17: Hoare triple {2293#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2293#false} is VALID [2022-04-08 10:07:25,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {2293#false} assume !(~y~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:25,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {2293#false} assume !(~z~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:25,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {2293#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2293#false} is VALID [2022-04-08 10:07:25,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2293#false} is VALID [2022-04-08 10:07:25,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:25,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:25,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:25,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2298#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:25,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:25,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:25,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2297#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:25,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2292#true} is VALID [2022-04-08 10:07:25,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret17 := main(); {2292#true} is VALID [2022-04-08 10:07:25,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #94#return; {2292#true} is VALID [2022-04-08 10:07:25,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-08 10:07:25,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2292#true} is VALID [2022-04-08 10:07:25,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2292#true} is VALID [2022-04-08 10:07:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:07:25,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024190273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:25,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:25,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-08 10:07:25,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:25,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393452060] [2022-04-08 10:07:25,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393452060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:25,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:25,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:07:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859075584] [2022-04-08 10:07:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-08 10:07:25,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:25,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-08 10:07:25,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:25,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:07:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:07:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:07:25,029 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-08 10:07:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:25,263 INFO L93 Difference]: Finished difference Result 108 states and 154 transitions. [2022-04-08 10:07:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:07:25,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-08 10:07:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-08 10:07:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-08 10:07:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-08 10:07:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-08 10:07:25,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-08 10:07:25,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:25,323 INFO L225 Difference]: With dead ends: 108 [2022-04-08 10:07:25,323 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 10:07:25,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:07:25,324 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:25,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:07:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 10:07:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2022-04-08 10:07:25,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:25,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:25,434 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:25,434 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:25,436 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2022-04-08 10:07:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2022-04-08 10:07:25,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:25,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:25,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 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 97 states. [2022-04-08 10:07:25,437 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 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 97 states. [2022-04-08 10:07:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:25,439 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2022-04-08 10:07:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2022-04-08 10:07:25,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:25,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:25,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:25,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2022-04-08 10:07:25,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 21 [2022-04-08 10:07:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:25,442 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2022-04-08 10:07:25,442 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-08 10:07:25,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 100 transitions. [2022-04-08 10:07:25,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-04-08 10:07:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:07:25,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:25,549 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:25,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:25,765 WARN L460 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-08 10:07:25,765 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 830872025, now seen corresponding path program 7 times [2022-04-08 10:07:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:25,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2047821495] [2022-04-08 10:07:25,768 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:25,768 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash 830872025, now seen corresponding path program 8 times [2022-04-08 10:07:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:25,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256132198] [2022-04-08 10:07:25,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:25,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:25,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:25,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {2996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-08 10:07:25,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-08 10:07:25,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-08 10:07:25,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:25,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-08 10:07:25,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-08 10:07:25,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-08 10:07:25,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret17 := main(); {2985#true} is VALID [2022-04-08 10:07:25,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {2985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2990#(= main_~y~0 0)} is VALID [2022-04-08 10:07:25,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:25,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {2991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:25,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {2992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:25,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {2993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:25,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:25,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2995#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:25,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {2995#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:25,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:25,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#false} assume !(~x~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:25,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {2986#false} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:25,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:25,894 INFO L272 TraceCheckUtils]: 17: Hoare triple {2986#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2986#false} is VALID [2022-04-08 10:07:25,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#false} ~cond := #in~cond; {2986#false} is VALID [2022-04-08 10:07:25,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#false} assume 0 == ~cond; {2986#false} is VALID [2022-04-08 10:07:25,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2022-04-08 10:07:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:25,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:25,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256132198] [2022-04-08 10:07:25,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256132198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:25,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746989053] [2022-04-08 10:07:25,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:25,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:25,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:25,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 10:07:25,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:25,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:25,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:07:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:25,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:26,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2985#true} is VALID [2022-04-08 10:07:26,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {2985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-08 10:07:26,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-08 10:07:26,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-08 10:07:26,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret17 := main(); {2985#true} is VALID [2022-04-08 10:07:26,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {2985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2990#(= main_~y~0 0)} is VALID [2022-04-08 10:07:26,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:26,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {2991#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:26,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {2992#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:26,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {2993#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:26,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:26,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {2994#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3033#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {3033#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#false} assume !(~x~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {2986#false} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L272 TraceCheckUtils]: 17: Hoare triple {2986#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#false} ~cond := #in~cond; {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#false} assume 0 == ~cond; {2986#false} is VALID [2022-04-08 10:07:26,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2022-04-08 10:07:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:26,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:26,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {2986#false} assume 0 == ~cond; {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {2986#false} ~cond := #in~cond; {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L272 TraceCheckUtils]: 17: Hoare triple {2986#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {2986#false} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#false} assume !(~x~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#false} assume !(~y~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {3085#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2986#false} is VALID [2022-04-08 10:07:26,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {3089#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3085#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:26,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {3089#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3089#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:26,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {3096#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3089#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:26,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {3100#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3096#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:26,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {3104#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3100#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:26,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {3108#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3104#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:26,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {2985#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3108#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:26,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret17 := main(); {2985#true} is VALID [2022-04-08 10:07:26,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #94#return; {2985#true} is VALID [2022-04-08 10:07:26,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2022-04-08 10:07:26,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {2985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2985#true} is VALID [2022-04-08 10:07:26,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2985#true} is VALID [2022-04-08 10:07:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:26,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746989053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:26,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:26,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 10:07:26,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:26,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2047821495] [2022-04-08 10:07:26,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2047821495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:26,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:26,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:07:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131716255] [2022-04-08 10:07:26,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-08 10:07:26,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:26,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-08 10:07:26,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:26,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:07:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:26,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:07:26,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:07:26,242 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-08 10:07:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:26,984 INFO L93 Difference]: Finished difference Result 119 states and 180 transitions. [2022-04-08 10:07:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:07:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-08 10:07:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-08 10:07:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-08 10:07:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-08 10:07:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-08 10:07:26,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-08 10:07:27,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:27,061 INFO L225 Difference]: With dead ends: 119 [2022-04-08 10:07:27,061 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 10:07:27,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:07:27,062 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:27,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 70 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:07:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 10:07:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2022-04-08 10:07:27,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:27,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:27,202 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:27,202 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:27,204 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-08 10:07:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-08 10:07:27,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:27,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:27,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 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 108 states. [2022-04-08 10:07:27,205 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 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 108 states. [2022-04-08 10:07:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:27,207 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-08 10:07:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-08 10:07:27,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:27,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:27,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:27,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2022-04-08 10:07:27,209 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 21 [2022-04-08 10:07:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:27,209 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2022-04-08 10:07:27,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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-08 10:07:27,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 119 transitions. [2022-04-08 10:07:27,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2022-04-08 10:07:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:07:27,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:27,321 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:27,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:27,531 WARN L460 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-08 10:07:27,532 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1281409098, now seen corresponding path program 9 times [2022-04-08 10:07:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:27,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [388263543] [2022-04-08 10:07:27,534 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:27,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1281409098, now seen corresponding path program 10 times [2022-04-08 10:07:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:27,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857865008] [2022-04-08 10:07:27,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:27,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-08 10:07:27,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-08 10:07:27,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-08 10:07:27,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {3767#true} call ULTIMATE.init(); {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:27,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-08 10:07:27,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-08 10:07:27,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-08 10:07:27,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {3767#true} call #t~ret17 := main(); {3767#true} is VALID [2022-04-08 10:07:27,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3772#(= main_~y~0 0)} is VALID [2022-04-08 10:07:27,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {3772#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:27,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {3773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:27,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {3774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:27,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {3775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:27,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:27,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:27,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3778#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:27,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {3778#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#false} assume !(~x~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#false} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,650 INFO L272 TraceCheckUtils]: 18: Hoare triple {3768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3768#false} is VALID [2022-04-08 10:07:27,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#false} ~cond := #in~cond; {3768#false} is VALID [2022-04-08 10:07:27,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {3768#false} assume 0 == ~cond; {3768#false} is VALID [2022-04-08 10:07:27,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-04-08 10:07:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857865008] [2022-04-08 10:07:27,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857865008] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443249982] [2022-04-08 10:07:27,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:27,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:27,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:27,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 10:07:27,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:27,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:27,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:07:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:27,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:27,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {3767#true} call ULTIMATE.init(); {3767#true} is VALID [2022-04-08 10:07:27,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-08 10:07:27,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-08 10:07:27,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-08 10:07:27,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {3767#true} call #t~ret17 := main(); {3767#true} is VALID [2022-04-08 10:07:27,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3772#(= main_~y~0 0)} is VALID [2022-04-08 10:07:27,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {3772#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:27,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {3773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:27,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {3774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:27,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {3775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:27,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:27,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:27,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {3777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:27,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {3819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#false} assume !(~x~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#false} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:27,852 INFO L272 TraceCheckUtils]: 18: Hoare triple {3768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3768#false} is VALID [2022-04-08 10:07:27,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#false} ~cond := #in~cond; {3768#false} is VALID [2022-04-08 10:07:27,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {3768#false} assume 0 == ~cond; {3768#false} is VALID [2022-04-08 10:07:27,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-04-08 10:07:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:27,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:28,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-04-08 10:07:28,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {3768#false} assume 0 == ~cond; {3768#false} is VALID [2022-04-08 10:07:28,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#false} ~cond := #in~cond; {3768#false} is VALID [2022-04-08 10:07:28,009 INFO L272 TraceCheckUtils]: 18: Hoare triple {3768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3768#false} is VALID [2022-04-08 10:07:28,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:28,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#false} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:28,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#false} assume !(~x~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:28,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#false} assume !(~y~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:28,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {3871#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3768#false} is VALID [2022-04-08 10:07:28,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {3875#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3871#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:28,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {3875#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3875#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:28,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {3882#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3875#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:28,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {3886#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3882#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:28,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {3890#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3886#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:28,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {3894#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3890#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:28,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {3898#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3894#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:28,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3898#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:28,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {3767#true} call #t~ret17 := main(); {3767#true} is VALID [2022-04-08 10:07:28,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3767#true} {3767#true} #94#return; {3767#true} is VALID [2022-04-08 10:07:28,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-04-08 10:07:28,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3767#true} is VALID [2022-04-08 10:07:28,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {3767#true} call ULTIMATE.init(); {3767#true} is VALID [2022-04-08 10:07:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:28,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443249982] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:28,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:28,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 10:07:28,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:28,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [388263543] [2022-04-08 10:07:28,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [388263543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:28,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:28,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:07:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180746035] [2022-04-08 10:07:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:28,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:07:28,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:28,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:28,033 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-08 10:07:28,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:07:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:28,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:07:28,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:07:28,034 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:28,991 INFO L93 Difference]: Finished difference Result 137 states and 209 transitions. [2022-04-08 10:07:28,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:07:28,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 10:07:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-08 10:07:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-08 10:07:28,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-04-08 10:07:29,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:29,087 INFO L225 Difference]: With dead ends: 137 [2022-04-08 10:07:29,087 INFO L226 Difference]: Without dead ends: 126 [2022-04-08 10:07:29,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:07:29,087 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 89 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:29,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 79 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:07:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-08 10:07:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2022-04-08 10:07:29,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:29,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,228 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,228 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:29,230 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2022-04-08 10:07:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2022-04-08 10:07:29,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:29,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:29,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 126 states. [2022-04-08 10:07:29,231 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 126 states. [2022-04-08 10:07:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:29,233 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2022-04-08 10:07:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2022-04-08 10:07:29,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:29,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:29,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:29,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2022-04-08 10:07:29,236 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 22 [2022-04-08 10:07:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:29,236 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2022-04-08 10:07:29,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:29,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 138 transitions. [2022-04-08 10:07:29,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2022-04-08 10:07:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:07:29,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:29,370 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:29,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:29,570 WARN L460 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-08 10:07:29,570 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-08 10:07:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238927559] [2022-04-08 10:07:29,573 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:29,573 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 2 times [2022-04-08 10:07:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:29,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483401832] [2022-04-08 10:07:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:29,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:29,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-08 10:07:29,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-08 10:07:29,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-08 10:07:29,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {4657#true} call ULTIMATE.init(); {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:29,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-08 10:07:29,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-08 10:07:29,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-08 10:07:29,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {4657#true} call #t~ret17 := main(); {4657#true} is VALID [2022-04-08 10:07:29,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:07:29,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4663#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-08 10:07:29,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {4663#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {4664#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-08 10:07:29,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {4664#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {4666#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:29,818 INFO L272 TraceCheckUtils]: 19: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:07:29,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {4668#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4669#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:07:29,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {4669#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4658#false} is VALID [2022-04-08 10:07:29,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {4658#false} assume !false; {4658#false} is VALID [2022-04-08 10:07:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:07:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:29,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483401832] [2022-04-08 10:07:29,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483401832] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:29,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690627459] [2022-04-08 10:07:29,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:29,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:29,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:29,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 10:07:29,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:29,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:29,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:07:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:29,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:30,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {4657#true} call ULTIMATE.init(); {4657#true} is VALID [2022-04-08 10:07:30,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-08 10:07:30,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-08 10:07:30,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-08 10:07:30,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {4657#true} call #t~ret17 := main(); {4657#true} is VALID [2022-04-08 10:07:30,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:07:30,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {4662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4692#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-08 10:07:30,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {4692#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4696#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {4696#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} ~z~0 := ~y~0; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-08 10:07:30,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-08 10:07:30,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-08 10:07:30,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-08 10:07:30,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {4704#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:07:30,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {4700#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:30,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:30,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {4739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4658#false} is VALID [2022-04-08 10:07:30,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {4658#false} assume !false; {4658#false} is VALID [2022-04-08 10:07:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:07:30,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:30,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {4658#false} assume !false; {4658#false} is VALID [2022-04-08 10:07:30,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {4739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4658#false} is VALID [2022-04-08 10:07:30,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:30,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:30,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4667#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {4786#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4761#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:07:30,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {4786#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:07:30,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {4794#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {4790#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:07:30,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {4798#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4794#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:07:30,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4798#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:07:30,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {4657#true} call #t~ret17 := main(); {4657#true} is VALID [2022-04-08 10:07:30,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4657#true} {4657#true} #94#return; {4657#true} is VALID [2022-04-08 10:07:30,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume true; {4657#true} is VALID [2022-04-08 10:07:30,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4657#true} is VALID [2022-04-08 10:07:30,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {4657#true} call ULTIMATE.init(); {4657#true} is VALID [2022-04-08 10:07:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:07:30,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690627459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:30,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:30,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-04-08 10:07:30,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:30,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238927559] [2022-04-08 10:07:30,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238927559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:30,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:30,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:07:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314998326] [2022-04-08 10:07:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:30,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:07:30,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:30,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:30,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:30,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:07:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:30,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:07:30,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:07:30,760 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:31,621 INFO L93 Difference]: Finished difference Result 117 states and 157 transitions. [2022-04-08 10:07:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:07:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:07:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-08 10:07:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-08 10:07:31,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-08 10:07:31,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:31,675 INFO L225 Difference]: With dead ends: 117 [2022-04-08 10:07:31,675 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 10:07:31,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:07:31,676 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:31,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:07:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 10:07:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2022-04-08 10:07:31,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:31,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,867 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,868 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:31,870 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2022-04-08 10:07:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2022-04-08 10:07:31,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:31,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:31,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 108 states. [2022-04-08 10:07:31,871 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 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 108 states. [2022-04-08 10:07:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:31,872 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2022-04-08 10:07:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2022-04-08 10:07:31,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:31,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:31,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:31,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2022-04-08 10:07:31,874 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 23 [2022-04-08 10:07:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:31,874 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2022-04-08 10:07:31,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:31,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 138 transitions. [2022-04-08 10:07:32,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2022-04-08 10:07:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:07:32,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:32,048 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:32,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:32,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 10:07:32,260 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash -169119975, now seen corresponding path program 3 times [2022-04-08 10:07:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:32,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1445049283] [2022-04-08 10:07:32,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:32,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash -169119975, now seen corresponding path program 4 times [2022-04-08 10:07:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:32,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146015448] [2022-04-08 10:07:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {5497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-08 10:07:32,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-08 10:07:32,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-08 10:07:32,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {5485#true} call ULTIMATE.init(); {5497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:32,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-08 10:07:32,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-08 10:07:32,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-08 10:07:32,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#true} call #t~ret17 := main(); {5485#true} is VALID [2022-04-08 10:07:32,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5490#(= main_~y~0 0)} is VALID [2022-04-08 10:07:32,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {5490#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5491#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:32,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {5491#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:32,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:32,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {5492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5493#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:32,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {5493#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5494#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:32,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {5494#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5495#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:32,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {5495#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5495#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:32,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {5495#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5494#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:32,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {5494#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:32,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:32,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:32,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {5496#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {5486#false} assume !(~y~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,382 INFO L272 TraceCheckUtils]: 19: Hoare triple {5486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5486#false} is VALID [2022-04-08 10:07:32,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {5486#false} ~cond := #in~cond; {5486#false} is VALID [2022-04-08 10:07:32,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {5486#false} assume 0 == ~cond; {5486#false} is VALID [2022-04-08 10:07:32,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {5486#false} assume !false; {5486#false} is VALID [2022-04-08 10:07:32,383 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-08 10:07:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146015448] [2022-04-08 10:07:32,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146015448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969565724] [2022-04-08 10:07:32,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:32,386 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:32,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 10:07:32,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:32,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:32,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:07:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:32,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {5485#true} call ULTIMATE.init(); {5485#true} is VALID [2022-04-08 10:07:32,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {5485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-08 10:07:32,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-08 10:07:32,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-08 10:07:32,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#true} call #t~ret17 := main(); {5485#true} is VALID [2022-04-08 10:07:32,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5485#true} is VALID [2022-04-08 10:07:32,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:32,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:32,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:32,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:32,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:32,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {5486#false} assume !(~z~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {5486#false} assume !(~y~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,523 INFO L272 TraceCheckUtils]: 19: Hoare triple {5486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5486#false} is VALID [2022-04-08 10:07:32,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {5486#false} ~cond := #in~cond; {5486#false} is VALID [2022-04-08 10:07:32,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {5486#false} assume 0 == ~cond; {5486#false} is VALID [2022-04-08 10:07:32,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {5486#false} assume !false; {5486#false} is VALID [2022-04-08 10:07:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:07:32,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:32,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {5486#false} assume !false; {5486#false} is VALID [2022-04-08 10:07:32,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {5486#false} assume 0 == ~cond; {5486#false} is VALID [2022-04-08 10:07:32,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {5486#false} ~cond := #in~cond; {5486#false} is VALID [2022-04-08 10:07:32,605 INFO L272 TraceCheckUtils]: 19: Hoare triple {5486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5486#false} is VALID [2022-04-08 10:07:32,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {5486#false} assume !(~y~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {5486#false} assume !(~z~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5486#false} is VALID [2022-04-08 10:07:32,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {5536#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5536#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:32,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:32,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:32,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:32,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5523#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:32,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5519#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:32,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5485#true} is VALID [2022-04-08 10:07:32,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#true} call #t~ret17 := main(); {5485#true} is VALID [2022-04-08 10:07:32,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#true} {5485#true} #94#return; {5485#true} is VALID [2022-04-08 10:07:32,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#true} assume true; {5485#true} is VALID [2022-04-08 10:07:32,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {5485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5485#true} is VALID [2022-04-08 10:07:32,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {5485#true} call ULTIMATE.init(); {5485#true} is VALID [2022-04-08 10:07:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:07:32,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969565724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:32,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:32,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-08 10:07:32,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:32,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1445049283] [2022-04-08 10:07:32,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1445049283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:32,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:32,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:07:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135653265] [2022-04-08 10:07:32,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:32,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:07:32,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:32,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:32,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:32,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:07:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:07:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:07:32,643 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:33,718 INFO L93 Difference]: Finished difference Result 193 states and 279 transitions. [2022-04-08 10:07:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:07:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:07:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 115 transitions. [2022-04-08 10:07:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 115 transitions. [2022-04-08 10:07:33,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 115 transitions. [2022-04-08 10:07:33,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:33,817 INFO L225 Difference]: With dead ends: 193 [2022-04-08 10:07:33,817 INFO L226 Difference]: Without dead ends: 159 [2022-04-08 10:07:33,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:07:33,818 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 66 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:33,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 57 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:07:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-08 10:07:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 122. [2022-04-08 10:07:34,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:34,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,059 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,059 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:34,062 INFO L93 Difference]: Finished difference Result 159 states and 207 transitions. [2022-04-08 10:07:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2022-04-08 10:07:34,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:34,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:34,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 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 159 states. [2022-04-08 10:07:34,066 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 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 159 states. [2022-04-08 10:07:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:34,068 INFO L93 Difference]: Finished difference Result 159 states and 207 transitions. [2022-04-08 10:07:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2022-04-08 10:07:34,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:34,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:34,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:34,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2022-04-08 10:07:34,070 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 23 [2022-04-08 10:07:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:34,070 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2022-04-08 10:07:34,071 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:34,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 166 transitions. [2022-04-08 10:07:34,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2022-04-08 10:07:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:07:34,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:34,271 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:34,287 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-08 10:07:34,471 WARN L460 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-08 10:07:34,472 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1957352825, now seen corresponding path program 11 times [2022-04-08 10:07:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:34,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775280491] [2022-04-08 10:07:34,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:34,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1957352825, now seen corresponding path program 12 times [2022-04-08 10:07:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:34,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966947268] [2022-04-08 10:07:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:34,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {6631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-08 10:07:34,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-08 10:07:34,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-08 10:07:34,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} call ULTIMATE.init(); {6631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:34,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {6631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-08 10:07:34,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-08 10:07:34,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-08 10:07:34,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} call #t~ret17 := main(); {6618#true} is VALID [2022-04-08 10:07:34,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6623#(= main_~y~0 0)} is VALID [2022-04-08 10:07:34,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {6623#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6624#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:34,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6625#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:34,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {6625#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6626#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:34,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {6626#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6627#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:34,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {6627#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6628#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:34,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {6628#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:34,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:34,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6630#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:34,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {6630#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {6619#false} assume !(~x~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {6619#false} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,618 INFO L272 TraceCheckUtils]: 19: Hoare triple {6619#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6619#false} is VALID [2022-04-08 10:07:34,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {6619#false} ~cond := #in~cond; {6619#false} is VALID [2022-04-08 10:07:34,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {6619#false} assume 0 == ~cond; {6619#false} is VALID [2022-04-08 10:07:34,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {6619#false} assume !false; {6619#false} is VALID [2022-04-08 10:07:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:34,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:34,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966947268] [2022-04-08 10:07:34,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966947268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:34,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618310248] [2022-04-08 10:07:34,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:34,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:34,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:34,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:34,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 10:07:34,661 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:07:34,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:34,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:07:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:34,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:34,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} call ULTIMATE.init(); {6618#true} is VALID [2022-04-08 10:07:34,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-08 10:07:34,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-08 10:07:34,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-08 10:07:34,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} call #t~ret17 := main(); {6618#true} is VALID [2022-04-08 10:07:34,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6623#(= main_~y~0 0)} is VALID [2022-04-08 10:07:34,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {6623#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6624#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:34,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6625#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:34,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {6625#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6626#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:34,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {6626#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6627#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:34,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {6627#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6628#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:34,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {6628#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:34,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:34,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {6629#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6674#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:34,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {6674#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {6619#false} assume !(~x~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {6619#false} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L272 TraceCheckUtils]: 19: Hoare triple {6619#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {6619#false} ~cond := #in~cond; {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {6619#false} assume 0 == ~cond; {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {6619#false} assume !false; {6619#false} is VALID [2022-04-08 10:07:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:34,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:35,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {6619#false} assume !false; {6619#false} is VALID [2022-04-08 10:07:35,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {6619#false} assume 0 == ~cond; {6619#false} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {6619#false} ~cond := #in~cond; {6619#false} is VALID [2022-04-08 10:07:35,025 INFO L272 TraceCheckUtils]: 19: Hoare triple {6619#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6619#false} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {6619#false} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {6619#false} assume !(~x~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {6619#false} assume !(~y~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:35,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {6726#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6619#false} is VALID [2022-04-08 10:07:35,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {6730#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6726#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:35,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {6730#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6730#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {6737#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6730#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:35,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {6741#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6737#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:35,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {6745#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6741#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:35,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {6749#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6745#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:35,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {6753#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6749#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:35,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {6757#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6753#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:35,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6757#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:35,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} call #t~ret17 := main(); {6618#true} is VALID [2022-04-08 10:07:35,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} #94#return; {6618#true} is VALID [2022-04-08 10:07:35,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-08 10:07:35,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-08 10:07:35,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} call ULTIMATE.init(); {6618#true} is VALID [2022-04-08 10:07:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:35,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618310248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:35,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:35,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:07:35,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:35,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775280491] [2022-04-08 10:07:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775280491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:35,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:35,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:07:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51313428] [2022-04-08 10:07:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:07:35,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:35,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:35,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:35,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:07:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:07:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:07:35,052 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:36,352 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-08 10:07:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:07:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:07:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-04-08 10:07:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-04-08 10:07:36,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 125 transitions. [2022-04-08 10:07:36,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:36,451 INFO L225 Difference]: With dead ends: 184 [2022-04-08 10:07:36,452 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 10:07:36,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:07:36,452 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 100 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:36,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 92 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:07:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 10:07:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 137. [2022-04-08 10:07:36,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:36,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,725 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,726 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:36,728 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2022-04-08 10:07:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2022-04-08 10:07:36,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:36,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:36,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 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 173 states. [2022-04-08 10:07:36,729 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 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 173 states. [2022-04-08 10:07:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:36,731 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2022-04-08 10:07:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2022-04-08 10:07:36,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:36,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:36,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:36,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2022-04-08 10:07:36,733 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 23 [2022-04-08 10:07:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:36,733 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2022-04-08 10:07:36,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:36,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 188 transitions. [2022-04-08 10:07:36,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2022-04-08 10:07:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:07:36,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:36,949 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:36,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:37,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 10:07:37,161 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash -720242666, now seen corresponding path program 13 times [2022-04-08 10:07:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:37,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000447539] [2022-04-08 10:07:37,164 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:37,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -720242666, now seen corresponding path program 14 times [2022-04-08 10:07:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:37,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616911135] [2022-04-08 10:07:37,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:37,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:37,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {7796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-08 10:07:37,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-08 10:07:37,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-08 10:07:37,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {7782#true} call ULTIMATE.init(); {7796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:37,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {7796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-08 10:07:37,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-08 10:07:37,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-08 10:07:37,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {7782#true} call #t~ret17 := main(); {7782#true} is VALID [2022-04-08 10:07:37,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {7782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7787#(= main_~y~0 0)} is VALID [2022-04-08 10:07:37,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {7787#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7788#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:37,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {7788#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7789#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:37,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {7789#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7790#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:37,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {7790#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7791#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:37,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {7791#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7792#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:37,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {7792#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7793#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:37,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {7793#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:37,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:37,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7795#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:37,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {7795#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {7783#false} assume !(~x~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {7783#false} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L272 TraceCheckUtils]: 20: Hoare triple {7783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {7783#false} ~cond := #in~cond; {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {7783#false} assume 0 == ~cond; {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {7783#false} assume !false; {7783#false} is VALID [2022-04-08 10:07:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616911135] [2022-04-08 10:07:37,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616911135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:37,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170882022] [2022-04-08 10:07:37,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:37,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:37,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:37,311 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:37,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 10:07:37,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:37,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:37,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:07:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:37,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:37,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {7782#true} call ULTIMATE.init(); {7782#true} is VALID [2022-04-08 10:07:37,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {7782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-08 10:07:37,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-08 10:07:37,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-08 10:07:37,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {7782#true} call #t~ret17 := main(); {7782#true} is VALID [2022-04-08 10:07:37,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {7782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7787#(= main_~y~0 0)} is VALID [2022-04-08 10:07:37,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {7787#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7788#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:37,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {7788#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7789#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:37,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {7789#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7790#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:37,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {7790#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7791#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:37,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {7791#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7792#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:37,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {7792#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7793#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:37,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {7793#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:37,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:37,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {7794#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7842#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:37,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {7842#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {7783#false} assume !(~x~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {7783#false} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,581 INFO L272 TraceCheckUtils]: 20: Hoare triple {7783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7783#false} is VALID [2022-04-08 10:07:37,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {7783#false} ~cond := #in~cond; {7783#false} is VALID [2022-04-08 10:07:37,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {7783#false} assume 0 == ~cond; {7783#false} is VALID [2022-04-08 10:07:37,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {7783#false} assume !false; {7783#false} is VALID [2022-04-08 10:07:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:37,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:37,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {7783#false} assume !false; {7783#false} is VALID [2022-04-08 10:07:37,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {7783#false} assume 0 == ~cond; {7783#false} is VALID [2022-04-08 10:07:37,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {7783#false} ~cond := #in~cond; {7783#false} is VALID [2022-04-08 10:07:37,774 INFO L272 TraceCheckUtils]: 20: Hoare triple {7783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7783#false} is VALID [2022-04-08 10:07:37,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {7783#false} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {7783#false} assume !(~x~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {7783#false} assume !(~y~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {7894#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7783#false} is VALID [2022-04-08 10:07:37,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {7898#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7894#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:37,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {7898#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7898#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:37,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {7905#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7898#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:37,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {7909#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7905#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:37,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {7913#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7909#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:37,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {7917#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7913#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:37,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {7921#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7917#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:37,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {7925#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7921#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:37,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {7929#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7925#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:37,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {7782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7929#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:37,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {7782#true} call #t~ret17 := main(); {7782#true} is VALID [2022-04-08 10:07:37,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7782#true} {7782#true} #94#return; {7782#true} is VALID [2022-04-08 10:07:37,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {7782#true} assume true; {7782#true} is VALID [2022-04-08 10:07:37,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {7782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7782#true} is VALID [2022-04-08 10:07:37,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {7782#true} call ULTIMATE.init(); {7782#true} is VALID [2022-04-08 10:07:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:37,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170882022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:37,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:07:37,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:37,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000447539] [2022-04-08 10:07:37,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000447539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:37,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:07:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619353023] [2022-04-08 10:07:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:37,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:07:37,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:37,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:37,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:37,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:07:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:37,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:07:37,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:07:37,798 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,391 INFO L93 Difference]: Finished difference Result 204 states and 306 transitions. [2022-04-08 10:07:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:07:39,391 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 10:07:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-08 10:07:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-08 10:07:39,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-08 10:07:39,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:39,507 INFO L225 Difference]: With dead ends: 204 [2022-04-08 10:07:39,507 INFO L226 Difference]: Without dead ends: 193 [2022-04-08 10:07:39,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:07:39,508 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 117 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:39,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:07:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-08 10:07:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 152. [2022-04-08 10:07:39,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:39,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,827 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,827 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,830 INFO L93 Difference]: Finished difference Result 193 states and 265 transitions. [2022-04-08 10:07:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2022-04-08 10:07:39,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:39,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:39,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 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 193 states. [2022-04-08 10:07:39,830 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 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 193 states. [2022-04-08 10:07:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,833 INFO L93 Difference]: Finished difference Result 193 states and 265 transitions. [2022-04-08 10:07:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2022-04-08 10:07:39,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:39,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:39,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:39,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.401360544217687) internal successors, (206), 147 states have internal predecessors, (206), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 210 transitions. [2022-04-08 10:07:39,835 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 210 transitions. Word has length 24 [2022-04-08 10:07:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:39,836 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 210 transitions. [2022-04-08 10:07:39,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:39,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 210 transitions. [2022-04-08 10:07:40,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 210 transitions. [2022-04-08 10:07:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:07:40,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:40,077 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:40,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:40,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:07:40,278 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1256652584, now seen corresponding path program 3 times [2022-04-08 10:07:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:40,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987476251] [2022-04-08 10:07:40,280 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:40,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1256652584, now seen corresponding path program 4 times [2022-04-08 10:07:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793195804] [2022-04-08 10:07:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {9073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-08 10:07:40,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-08 10:07:40,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-08 10:07:40,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {9066#true} call ULTIMATE.init(); {9073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:40,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {9073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-08 10:07:40,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-08 10:07:40,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-08 10:07:40,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {9066#true} call #t~ret17 := main(); {9066#true} is VALID [2022-04-08 10:07:40,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {9066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9066#true} is VALID [2022-04-08 10:07:40,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9066#true} is VALID [2022-04-08 10:07:40,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#true} assume !(~x~0 % 4294967296 > 0); {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9067#false} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {9067#false} assume !(~x~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {9067#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9067#false} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {9067#false} assume !(~z~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-08 10:07:40,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {9067#false} assume !(~y~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,327 INFO L272 TraceCheckUtils]: 21: Hoare triple {9067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9067#false} is VALID [2022-04-08 10:07:40,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {9067#false} ~cond := #in~cond; {9067#false} is VALID [2022-04-08 10:07:40,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#false} assume 0 == ~cond; {9067#false} is VALID [2022-04-08 10:07:40,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {9067#false} assume !false; {9067#false} is VALID [2022-04-08 10:07:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:40,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793195804] [2022-04-08 10:07:40,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793195804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:40,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296081676] [2022-04-08 10:07:40,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:40,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:40,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:40,328 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:40,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 10:07:40,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:40,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:40,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:07:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:40,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {9066#true} call ULTIMATE.init(); {9066#true} is VALID [2022-04-08 10:07:40,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-08 10:07:40,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-08 10:07:40,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-08 10:07:40,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {9066#true} call #t~ret17 := main(); {9066#true} is VALID [2022-04-08 10:07:40,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {9066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9066#true} is VALID [2022-04-08 10:07:40,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9066#true} is VALID [2022-04-08 10:07:40,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#true} assume !(~x~0 % 4294967296 > 0); {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {9067#false} assume !(~x~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {9067#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {9067#false} assume !(~z~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {9067#false} assume !(~y~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L272 TraceCheckUtils]: 21: Hoare triple {9067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {9067#false} ~cond := #in~cond; {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#false} assume 0 == ~cond; {9067#false} is VALID [2022-04-08 10:07:40,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {9067#false} assume !false; {9067#false} is VALID [2022-04-08 10:07:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:40,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:40,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {9067#false} assume !false; {9067#false} is VALID [2022-04-08 10:07:40,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {9067#false} assume 0 == ~cond; {9067#false} is VALID [2022-04-08 10:07:40,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {9067#false} ~cond := #in~cond; {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L272 TraceCheckUtils]: 21: Hoare triple {9067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {9067#false} assume !(~y~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {9067#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {9067#false} assume !(~z~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {9067#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {9067#false} assume !(~x~0 % 4294967296 > 0); {9067#false} is VALID [2022-04-08 10:07:40,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9067#false} is VALID [2022-04-08 10:07:40,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9072#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:40,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#true} assume !(~x~0 % 4294967296 > 0); {9071#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:40,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9066#true} is VALID [2022-04-08 10:07:40,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {9066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9066#true} is VALID [2022-04-08 10:07:40,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {9066#true} call #t~ret17 := main(); {9066#true} is VALID [2022-04-08 10:07:40,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9066#true} {9066#true} #94#return; {9066#true} is VALID [2022-04-08 10:07:40,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {9066#true} assume true; {9066#true} is VALID [2022-04-08 10:07:40,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9066#true} is VALID [2022-04-08 10:07:40,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {9066#true} call ULTIMATE.init(); {9066#true} is VALID [2022-04-08 10:07:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:40,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296081676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:40,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:40,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-08 10:07:40,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:40,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987476251] [2022-04-08 10:07:40,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987476251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:40,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:40,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:07:40,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715471867] [2022-04-08 10:07:40,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:40,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:07:40,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:40,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:40,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:40,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:07:40,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:40,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:07:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:07:40,672 INFO L87 Difference]: Start difference. First operand 152 states and 210 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,247 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2022-04-08 10:07:41,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:07:41,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:07:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-08 10:07:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-08 10:07:41,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-08 10:07:41,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,303 INFO L225 Difference]: With dead ends: 233 [2022-04-08 10:07:41,303 INFO L226 Difference]: Without dead ends: 175 [2022-04-08 10:07:41,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:07:41,304 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:41,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:07:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-08 10:07:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 137. [2022-04-08 10:07:41,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:41,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,610 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,610 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,612 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2022-04-08 10:07:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 245 transitions. [2022-04-08 10:07:41,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:41,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:41,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 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 175 states. [2022-04-08 10:07:41,613 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 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 175 states. [2022-04-08 10:07:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,615 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2022-04-08 10:07:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 245 transitions. [2022-04-08 10:07:41,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:41,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:41,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:41,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2022-04-08 10:07:41,617 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 187 transitions. Word has length 25 [2022-04-08 10:07:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:41,618 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 187 transitions. [2022-04-08 10:07:41,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 187 transitions. [2022-04-08 10:07:41,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 187 transitions. [2022-04-08 10:07:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:07:41,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:41,865 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:41,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:42,066 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 10:07:42,066 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash -565826439, now seen corresponding path program 3 times [2022-04-08 10:07:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:42,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338325678] [2022-04-08 10:07:42,069 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:42,069 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash -565826439, now seen corresponding path program 4 times [2022-04-08 10:07:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:42,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207572659] [2022-04-08 10:07:42,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:42,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {10326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-08 10:07:42,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-08 10:07:42,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-08 10:07:42,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {10317#true} call ULTIMATE.init(); {10326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:42,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {10326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-08 10:07:42,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-08 10:07:42,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-08 10:07:42,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {10317#true} call #t~ret17 := main(); {10317#true} is VALID [2022-04-08 10:07:42,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {10317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10317#true} is VALID [2022-04-08 10:07:42,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {10317#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:42,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:42,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:42,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:42,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {10323#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10324#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:07:42,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {10324#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:42,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:42,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:42,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:42,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {10325#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {10318#false} assume !(~z~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {10318#false} assume !(~y~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L272 TraceCheckUtils]: 21: Hoare triple {10318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {10318#false} ~cond := #in~cond; {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {10318#false} assume 0 == ~cond; {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {10318#false} assume !false; {10318#false} is VALID [2022-04-08 10:07:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207572659] [2022-04-08 10:07:42,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207572659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106368992] [2022-04-08 10:07:42,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:42,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:42,153 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:42,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 10:07:42,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:42,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:42,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:07:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:42,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:42,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {10317#true} call ULTIMATE.init(); {10317#true} is VALID [2022-04-08 10:07:42,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {10317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-08 10:07:42,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-08 10:07:42,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-08 10:07:42,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {10317#true} call #t~ret17 := main(); {10317#true} is VALID [2022-04-08 10:07:42,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {10317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10317#true} is VALID [2022-04-08 10:07:42,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {10317#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:42,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:42,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:42,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:42,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:42,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-08 10:07:42,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-08 10:07:42,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {10318#false} assume !(~z~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {10318#false} assume !(~y~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,385 INFO L272 TraceCheckUtils]: 21: Hoare triple {10318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10318#false} is VALID [2022-04-08 10:07:42,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {10318#false} ~cond := #in~cond; {10318#false} is VALID [2022-04-08 10:07:42,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {10318#false} assume 0 == ~cond; {10318#false} is VALID [2022-04-08 10:07:42,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {10318#false} assume !false; {10318#false} is VALID [2022-04-08 10:07:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:42,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:42,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {10318#false} assume !false; {10318#false} is VALID [2022-04-08 10:07:42,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {10318#false} assume 0 == ~cond; {10318#false} is VALID [2022-04-08 10:07:42,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {10318#false} ~cond := #in~cond; {10318#false} is VALID [2022-04-08 10:07:42,465 INFO L272 TraceCheckUtils]: 21: Hoare triple {10318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10318#false} is VALID [2022-04-08 10:07:42,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {10318#false} assume !(~y~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {10318#false} assume !(~z~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-08 10:07:42,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {10318#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10318#false} is VALID [2022-04-08 10:07:42,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10318#false} is VALID [2022-04-08 10:07:42,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10364#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:42,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:42,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:42,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:42,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10351#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:07:42,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {10317#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10322#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:42,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {10317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10317#true} is VALID [2022-04-08 10:07:42,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {10317#true} call #t~ret17 := main(); {10317#true} is VALID [2022-04-08 10:07:42,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10317#true} {10317#true} #94#return; {10317#true} is VALID [2022-04-08 10:07:42,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {10317#true} assume true; {10317#true} is VALID [2022-04-08 10:07:42,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {10317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10317#true} is VALID [2022-04-08 10:07:42,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {10317#true} call ULTIMATE.init(); {10317#true} is VALID [2022-04-08 10:07:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:42,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106368992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:42,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:42,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-08 10:07:42,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:42,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338325678] [2022-04-08 10:07:42,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338325678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:42,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:42,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:07:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85157275] [2022-04-08 10:07:42,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 25 [2022-04-08 10:07:42,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:42,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:42,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:42,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:07:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:42,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:07:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:07:42,493 INFO L87 Difference]: Start difference. First operand 137 states and 187 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:43,363 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2022-04-08 10:07:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:07:43,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 25 [2022-04-08 10:07:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 10:07:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 10:07:43,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 10:07:43,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:43,444 INFO L225 Difference]: With dead ends: 226 [2022-04-08 10:07:43,444 INFO L226 Difference]: Without dead ends: 209 [2022-04-08 10:07:43,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:07:43,445 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:43,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 49 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-08 10:07:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 150. [2022-04-08 10:07:43,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:43,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,826 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,826 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:43,829 INFO L93 Difference]: Finished difference Result 209 states and 296 transitions. [2022-04-08 10:07:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 296 transitions. [2022-04-08 10:07:43,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:43,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:43,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 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 209 states. [2022-04-08 10:07:43,830 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 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 209 states. [2022-04-08 10:07:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:43,833 INFO L93 Difference]: Finished difference Result 209 states and 296 transitions. [2022-04-08 10:07:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 296 transitions. [2022-04-08 10:07:43,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:43,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:43,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:43,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 205 transitions. [2022-04-08 10:07:43,835 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 205 transitions. Word has length 25 [2022-04-08 10:07:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:43,835 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 205 transitions. [2022-04-08 10:07:43,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:43,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 205 transitions. [2022-04-08 10:07:44,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2022-04-08 10:07:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:07:44,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:44,140 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:44,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:44,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 10:07:44,341 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2121324263, now seen corresponding path program 15 times [2022-04-08 10:07:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588104501] [2022-04-08 10:07:44,344 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:44,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2121324263, now seen corresponding path program 16 times [2022-04-08 10:07:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:44,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130905422] [2022-04-08 10:07:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:44,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {11671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-08 10:07:44,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-08 10:07:44,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-08 10:07:44,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {11656#true} call ULTIMATE.init(); {11671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:44,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {11671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-08 10:07:44,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-08 10:07:44,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-08 10:07:44,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {11656#true} call #t~ret17 := main(); {11656#true} is VALID [2022-04-08 10:07:44,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {11656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11661#(= main_~y~0 0)} is VALID [2022-04-08 10:07:44,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {11661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:44,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {11662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:44,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:44,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {11664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:44,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {11665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:44,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {11666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:44,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {11667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:44,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {11668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:44,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:44,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {11670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:44,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {11670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {11657#false} assume !(~x~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {11657#false} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,492 INFO L272 TraceCheckUtils]: 21: Hoare triple {11657#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11657#false} is VALID [2022-04-08 10:07:44,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {11657#false} ~cond := #in~cond; {11657#false} is VALID [2022-04-08 10:07:44,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {11657#false} assume 0 == ~cond; {11657#false} is VALID [2022-04-08 10:07:44,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {11657#false} assume !false; {11657#false} is VALID [2022-04-08 10:07:44,492 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-08 10:07:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130905422] [2022-04-08 10:07:44,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130905422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143904092] [2022-04-08 10:07:44,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:44,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:44,493 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:44,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 10:07:44,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:44,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:44,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:07:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:44,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:44,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {11656#true} call ULTIMATE.init(); {11656#true} is VALID [2022-04-08 10:07:44,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {11656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-08 10:07:44,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-08 10:07:44,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-08 10:07:44,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {11656#true} call #t~ret17 := main(); {11656#true} is VALID [2022-04-08 10:07:44,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {11656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11661#(= main_~y~0 0)} is VALID [2022-04-08 10:07:44,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {11661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:44,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {11662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:44,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:44,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {11664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:44,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {11665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:44,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {11666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:44,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {11667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:44,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {11668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:44,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:44,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {11669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {11720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {11720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {11657#false} assume !(~x~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {11657#false} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L272 TraceCheckUtils]: 21: Hoare triple {11657#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {11657#false} ~cond := #in~cond; {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {11657#false} assume 0 == ~cond; {11657#false} is VALID [2022-04-08 10:07:44,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {11657#false} assume !false; {11657#false} is VALID [2022-04-08 10:07:44,760 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-08 10:07:44,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:44,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {11657#false} assume !false; {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {11657#false} assume 0 == ~cond; {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {11657#false} ~cond := #in~cond; {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L272 TraceCheckUtils]: 21: Hoare triple {11657#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {11657#false} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {11657#false} assume !(~x~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {11657#false} assume !(~y~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {11772#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11657#false} is VALID [2022-04-08 10:07:44,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {11776#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {11772#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:44,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {11776#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11776#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:44,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {11783#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11776#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:44,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {11787#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11783#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:44,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {11791#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11787#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:44,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {11795#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11791#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:44,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {11799#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11795#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:44,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {11803#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11799#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:44,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {11807#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11803#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:44,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {11811#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11807#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:44,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {11656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11811#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:44,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {11656#true} call #t~ret17 := main(); {11656#true} is VALID [2022-04-08 10:07:44,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11656#true} {11656#true} #94#return; {11656#true} is VALID [2022-04-08 10:07:44,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {11656#true} assume true; {11656#true} is VALID [2022-04-08 10:07:44,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {11656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11656#true} is VALID [2022-04-08 10:07:44,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {11656#true} call ULTIMATE.init(); {11656#true} is VALID [2022-04-08 10:07:44,988 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-08 10:07:44,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143904092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:44,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:44,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:07:44,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:44,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588104501] [2022-04-08 10:07:44,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588104501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:44,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:44,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:07:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921142941] [2022-04-08 10:07:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 10:07:44,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:44,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 10:07:45,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:45,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:07:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:07:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:07:45,005 INFO L87 Difference]: Start difference. First operand 150 states and 205 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 10:07:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:46,905 INFO L93 Difference]: Finished difference Result 235 states and 356 transitions. [2022-04-08 10:07:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:07:46,905 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 10:07:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 10:07:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2022-04-08 10:07:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 10:07:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2022-04-08 10:07:46,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 147 transitions. [2022-04-08 10:07:47,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:47,019 INFO L225 Difference]: With dead ends: 235 [2022-04-08 10:07:47,019 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 10:07:47,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:07:47,020 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 113 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:47,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 109 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:07:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 10:07:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 166. [2022-04-08 10:07:47,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:47,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,428 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,428 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:47,430 INFO L93 Difference]: Finished difference Result 219 states and 297 transitions. [2022-04-08 10:07:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 297 transitions. [2022-04-08 10:07:47,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:47,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:47,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 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 219 states. [2022-04-08 10:07:47,431 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 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 219 states. [2022-04-08 10:07:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:47,434 INFO L93 Difference]: Finished difference Result 219 states and 297 transitions. [2022-04-08 10:07:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 297 transitions. [2022-04-08 10:07:47,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:47,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:47,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:47,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2022-04-08 10:07:47,436 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 25 [2022-04-08 10:07:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:47,436 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2022-04-08 10:07:47,436 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 10:07:47,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 228 transitions. [2022-04-08 10:07:47,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2022-04-08 10:07:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:07:47,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:47,755 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:47,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:47,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:47,955 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1462305435, now seen corresponding path program 1 times [2022-04-08 10:07:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:47,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014910413] [2022-04-08 10:07:47,957 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:47,958 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1462305435, now seen corresponding path program 2 times [2022-04-08 10:07:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:47,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590730181] [2022-04-08 10:07:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {13103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-08 10:07:48,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-08 10:07:48,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-08 10:07:48,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:48,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {13103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-08 10:07:48,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-08 10:07:48,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-08 10:07:48,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret17 := main(); {13092#true} is VALID [2022-04-08 10:07:48,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {13092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13097#(= main_~y~0 0)} is VALID [2022-04-08 10:07:48,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {13097#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13098#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:48,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {13098#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13099#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:48,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {13099#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:48,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:48,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13101#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:48,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {13101#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13102#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:48,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {13102#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {13093#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {13093#false} assume !(~x~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {13093#false} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L272 TraceCheckUtils]: 22: Hoare triple {13093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2022-04-08 10:07:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 10:07:48,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:48,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590730181] [2022-04-08 10:07:48,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590730181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:48,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946507007] [2022-04-08 10:07:48,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:48,076 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:48,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 10:07:48,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:48,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:48,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:07:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:48,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13092#true} is VALID [2022-04-08 10:07:48,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {13092#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-08 10:07:48,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-08 10:07:48,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-08 10:07:48,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret17 := main(); {13092#true} is VALID [2022-04-08 10:07:48,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {13092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13097#(= main_~y~0 0)} is VALID [2022-04-08 10:07:48,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {13097#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13098#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:48,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {13098#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13099#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:48,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {13099#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:48,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:48,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {13100#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13137#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:48,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {13137#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13141#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:48,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {13141#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {13093#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {13093#false} assume !(~x~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {13093#false} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L272 TraceCheckUtils]: 22: Hoare triple {13093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2022-04-08 10:07:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 10:07:48,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L272 TraceCheckUtils]: 22: Hoare triple {13093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {13093#false} assume !(~z~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {13093#false} assume !(~x~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {13093#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13093#false} is VALID [2022-04-08 10:07:48,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#false} assume !(~y~0 % 4294967296 > 0); {13093#false} is VALID [2022-04-08 10:07:48,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {13217#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13093#false} is VALID [2022-04-08 10:07:48,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {13221#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13217#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:48,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {13225#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {13221#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:07:48,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {13229#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13225#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:07:48,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {13092#true} ~z~0 := ~y~0; {13229#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:07:48,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {13092#true} assume !(~x~0 % 4294967296 > 0); {13092#true} is VALID [2022-04-08 10:07:48,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {13092#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13092#true} is VALID [2022-04-08 10:07:48,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {13092#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13092#true} is VALID [2022-04-08 10:07:48,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {13092#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13092#true} is VALID [2022-04-08 10:07:48,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {13092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13092#true} is VALID [2022-04-08 10:07:48,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret17 := main(); {13092#true} is VALID [2022-04-08 10:07:48,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #94#return; {13092#true} is VALID [2022-04-08 10:07:48,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2022-04-08 10:07:48,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {13092#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13092#true} is VALID [2022-04-08 10:07:48,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13092#true} is VALID [2022-04-08 10:07:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:07:48,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946507007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:48,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:48,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-08 10:07:48,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:48,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014910413] [2022-04-08 10:07:48,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014910413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:48,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:48,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:07:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390546625] [2022-04-08 10:07:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:07:48,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:48,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:48,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:48,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:07:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:07:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:07:48,342 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,161 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2022-04-08 10:07:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:07:49,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:07:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-08 10:07:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-08 10:07:49,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-08 10:07:49,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:49,215 INFO L225 Difference]: With dead ends: 203 [2022-04-08 10:07:49,215 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 10:07:49,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:07:49,216 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:49,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 54 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:07:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 10:07:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 166. [2022-04-08 10:07:49,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:49,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,634 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,634 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,636 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2022-04-08 10:07:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions. [2022-04-08 10:07:49,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:49,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:49,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 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 189 states. [2022-04-08 10:07:49,637 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 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 189 states. [2022-04-08 10:07:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:49,639 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2022-04-08 10:07:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions. [2022-04-08 10:07:49,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:49,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:49,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:49,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2022-04-08 10:07:49,641 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 26 [2022-04-08 10:07:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:49,641 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2022-04-08 10:07:49,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:49,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 227 transitions. [2022-04-08 10:07:49,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2022-04-08 10:07:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:07:49,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:49,974 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:49,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:50,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 10:07:50,179 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2144175877, now seen corresponding path program 5 times [2022-04-08 10:07:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:50,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336276822] [2022-04-08 10:07:50,181 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:50,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2144175877, now seen corresponding path program 6 times [2022-04-08 10:07:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:50,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420377135] [2022-04-08 10:07:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {14409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-08 10:07:50,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-08 10:07:50,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-08 10:07:50,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {14395#true} call ULTIMATE.init(); {14409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:50,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {14409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-08 10:07:50,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-08 10:07:50,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-08 10:07:50,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {14395#true} call #t~ret17 := main(); {14395#true} is VALID [2022-04-08 10:07:50,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {14395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14400#(= main_~y~0 0)} is VALID [2022-04-08 10:07:50,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {14400#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14401#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:50,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {14401#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14402#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:50,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {14402#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:50,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:50,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {14403#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {14404#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:50,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {14404#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14405#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:50,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {14405#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:50,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {14406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14407#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:50,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {14407#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14407#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:50,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {14407#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:50,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {14406#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14405#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:50,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {14405#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:50,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:50,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:50,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {14408#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {14396#false} assume !(~y~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,339 INFO L272 TraceCheckUtils]: 22: Hoare triple {14396#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14396#false} is VALID [2022-04-08 10:07:50,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {14396#false} ~cond := #in~cond; {14396#false} is VALID [2022-04-08 10:07:50,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {14396#false} assume 0 == ~cond; {14396#false} is VALID [2022-04-08 10:07:50,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {14396#false} assume !false; {14396#false} is VALID [2022-04-08 10:07:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:50,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420377135] [2022-04-08 10:07:50,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420377135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:50,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097712533] [2022-04-08 10:07:50,341 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:50,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:50,342 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:50,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 10:07:50,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:07:50,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:50,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:07:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:50,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:50,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {14395#true} call ULTIMATE.init(); {14395#true} is VALID [2022-04-08 10:07:50,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {14395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-08 10:07:50,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-08 10:07:50,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-08 10:07:50,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {14395#true} call #t~ret17 := main(); {14395#true} is VALID [2022-04-08 10:07:50,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {14395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14395#true} is VALID [2022-04-08 10:07:50,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {14395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:50,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:50,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:50,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:50,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:50,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:50,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:50,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {14396#false} assume !(~z~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {14396#false} assume !(~y~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,495 INFO L272 TraceCheckUtils]: 22: Hoare triple {14396#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14396#false} is VALID [2022-04-08 10:07:50,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {14396#false} ~cond := #in~cond; {14396#false} is VALID [2022-04-08 10:07:50,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {14396#false} assume 0 == ~cond; {14396#false} is VALID [2022-04-08 10:07:50,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {14396#false} assume !false; {14396#false} is VALID [2022-04-08 10:07:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:50,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:50,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {14396#false} assume !false; {14396#false} is VALID [2022-04-08 10:07:50,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {14396#false} assume 0 == ~cond; {14396#false} is VALID [2022-04-08 10:07:50,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {14396#false} ~cond := #in~cond; {14396#false} is VALID [2022-04-08 10:07:50,564 INFO L272 TraceCheckUtils]: 22: Hoare triple {14396#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14396#false} is VALID [2022-04-08 10:07:50,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {14396#false} assume !(~y~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {14396#false} assume !(~z~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14396#false} is VALID [2022-04-08 10:07:50,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {14455#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14455#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:50,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:50,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:50,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:50,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:50,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14439#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:07:50,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14435#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:07:50,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {14395#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14431#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:07:50,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {14395#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14395#true} is VALID [2022-04-08 10:07:50,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {14395#true} call #t~ret17 := main(); {14395#true} is VALID [2022-04-08 10:07:50,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14395#true} {14395#true} #94#return; {14395#true} is VALID [2022-04-08 10:07:50,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {14395#true} assume true; {14395#true} is VALID [2022-04-08 10:07:50,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {14395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14395#true} is VALID [2022-04-08 10:07:50,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {14395#true} call ULTIMATE.init(); {14395#true} is VALID [2022-04-08 10:07:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:07:50,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097712533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:50,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:50,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-08 10:07:50,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:50,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336276822] [2022-04-08 10:07:50,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336276822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:50,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:50,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:07:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687946131] [2022-04-08 10:07:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:07:50,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:50,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:50,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:50,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:07:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:07:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:07:50,589 INFO L87 Difference]: Start difference. First operand 166 states and 227 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:52,766 INFO L93 Difference]: Finished difference Result 315 states and 452 transitions. [2022-04-08 10:07:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:07:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:07:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 148 transitions. [2022-04-08 10:07:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 148 transitions. [2022-04-08 10:07:52,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 148 transitions. [2022-04-08 10:07:52,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:52,879 INFO L225 Difference]: With dead ends: 315 [2022-04-08 10:07:52,879 INFO L226 Difference]: Without dead ends: 269 [2022-04-08 10:07:52,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:07:52,880 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 74 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:52,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 67 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-08 10:07:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 196. [2022-04-08 10:07:53,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:53,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,424 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,424 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:53,427 INFO L93 Difference]: Finished difference Result 269 states and 343 transitions. [2022-04-08 10:07:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2022-04-08 10:07:53,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:53,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:53,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 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 269 states. [2022-04-08 10:07:53,428 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 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 269 states. [2022-04-08 10:07:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:53,431 INFO L93 Difference]: Finished difference Result 269 states and 343 transitions. [2022-04-08 10:07:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2022-04-08 10:07:53,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:53,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:53,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:53,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 191 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2022-04-08 10:07:53,434 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 26 [2022-04-08 10:07:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:53,434 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2022-04-08 10:07:53,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:53,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 265 transitions. [2022-04-08 10:07:53,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2022-04-08 10:07:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:07:53,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:53,842 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:53,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 10:07:54,048 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:07:54,048 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1689786486, now seen corresponding path program 17 times [2022-04-08 10:07:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:54,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [410580313] [2022-04-08 10:07:54,050 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:54,050 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1689786486, now seen corresponding path program 18 times [2022-04-08 10:07:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:54,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144542686] [2022-04-08 10:07:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:54,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {16195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-08 10:07:54,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-08 10:07:54,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-08 10:07:54,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {16179#true} call ULTIMATE.init(); {16195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:54,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {16195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-08 10:07:54,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-08 10:07:54,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-08 10:07:54,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {16179#true} call #t~ret17 := main(); {16179#true} is VALID [2022-04-08 10:07:54,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {16179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16184#(= main_~y~0 0)} is VALID [2022-04-08 10:07:54,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {16184#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16185#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:54,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {16185#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16186#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:54,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {16186#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16187#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:54,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {16187#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16188#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:54,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {16188#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16189#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:54,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {16189#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16190#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:54,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {16190#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16191#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:54,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {16191#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16192#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:54,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {16192#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:54,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:54,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16194#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:54,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {16194#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {16180#false} assume !(~x~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {16180#false} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,219 INFO L272 TraceCheckUtils]: 22: Hoare triple {16180#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16180#false} is VALID [2022-04-08 10:07:54,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#false} ~cond := #in~cond; {16180#false} is VALID [2022-04-08 10:07:54,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#false} assume 0 == ~cond; {16180#false} is VALID [2022-04-08 10:07:54,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {16180#false} assume !false; {16180#false} is VALID [2022-04-08 10:07:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:54,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:54,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144542686] [2022-04-08 10:07:54,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144542686] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:54,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362554155] [2022-04-08 10:07:54,220 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:54,221 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:54,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 10:07:54,263 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:07:54,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:54,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:07:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:54,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:54,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {16179#true} call ULTIMATE.init(); {16179#true} is VALID [2022-04-08 10:07:54,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {16179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-08 10:07:54,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-08 10:07:54,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-08 10:07:54,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {16179#true} call #t~ret17 := main(); {16179#true} is VALID [2022-04-08 10:07:54,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {16179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16184#(= main_~y~0 0)} is VALID [2022-04-08 10:07:54,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {16184#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16185#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:54,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {16185#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16186#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:54,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {16186#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16187#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:54,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {16187#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16188#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:54,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {16188#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16189#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:54,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {16189#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16190#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:54,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {16190#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16191#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:54,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {16191#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16192#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:54,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {16192#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:54,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:54,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {16193#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16247#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {16247#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {16180#false} assume !(~x~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {16180#false} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L272 TraceCheckUtils]: 22: Hoare triple {16180#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#false} ~cond := #in~cond; {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#false} assume 0 == ~cond; {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {16180#false} assume !false; {16180#false} is VALID [2022-04-08 10:07:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:54,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:54,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {16180#false} assume !false; {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#false} assume 0 == ~cond; {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#false} ~cond := #in~cond; {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L272 TraceCheckUtils]: 22: Hoare triple {16180#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {16180#false} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {16180#false} assume !(~x~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {16180#false} assume !(~y~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {16299#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16180#false} is VALID [2022-04-08 10:07:54,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {16303#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16299#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:54,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {16303#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16303#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:54,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {16310#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16303#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:54,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {16314#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16310#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:54,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {16318#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16314#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:54,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {16322#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16318#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:54,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {16326#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16322#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:54,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {16330#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16326#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:54,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {16334#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16330#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:54,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {16338#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16334#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:54,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {16342#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16338#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:54,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {16179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16342#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:54,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {16179#true} call #t~ret17 := main(); {16179#true} is VALID [2022-04-08 10:07:54,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16179#true} {16179#true} #94#return; {16179#true} is VALID [2022-04-08 10:07:54,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {16179#true} assume true; {16179#true} is VALID [2022-04-08 10:07:54,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {16179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16179#true} is VALID [2022-04-08 10:07:54,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {16179#true} call ULTIMATE.init(); {16179#true} is VALID [2022-04-08 10:07:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:54,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362554155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:54,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:54,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:07:54,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:54,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [410580313] [2022-04-08 10:07:54,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [410580313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:54,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:07:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218022738] [2022-04-08 10:07:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:07:54,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:54,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:54,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:54,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:07:54,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:07:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:07:54,742 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:57,102 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2022-04-08 10:07:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:07:57,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:07:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 160 transitions. [2022-04-08 10:07:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 160 transitions. [2022-04-08 10:07:57,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 160 transitions. [2022-04-08 10:07:57,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:57,224 INFO L225 Difference]: With dead ends: 289 [2022-04-08 10:07:57,224 INFO L226 Difference]: Without dead ends: 273 [2022-04-08 10:07:57,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:07:57,224 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 125 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:57,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 122 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:07:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-08 10:07:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 214. [2022-04-08 10:07:57,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:57,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,845 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,845 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:57,848 INFO L93 Difference]: Finished difference Result 273 states and 368 transitions. [2022-04-08 10:07:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 368 transitions. [2022-04-08 10:07:57,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:57,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:57,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 states have internal predecessors, (287), 3 states have call successors, (3), 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 273 states. [2022-04-08 10:07:57,849 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 states have internal predecessors, (287), 3 states have call successors, (3), 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 273 states. [2022-04-08 10:07:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:57,862 INFO L93 Difference]: Finished difference Result 273 states and 368 transitions. [2022-04-08 10:07:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 368 transitions. [2022-04-08 10:07:57,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:57,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:57,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:57,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 states have internal predecessors, (287), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 291 transitions. [2022-04-08 10:07:57,865 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 291 transitions. Word has length 26 [2022-04-08 10:07:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:57,865 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 291 transitions. [2022-04-08 10:07:57,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:57,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 291 transitions. [2022-04-08 10:07:58,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 291 transitions. [2022-04-08 10:07:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:07:58,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:58,275 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:58,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:58,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:58,492 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash -424864583, now seen corresponding path program 19 times [2022-04-08 10:07:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:58,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843354000] [2022-04-08 10:07:58,494 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:58,494 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash -424864583, now seen corresponding path program 20 times [2022-04-08 10:07:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:58,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495926187] [2022-04-08 10:07:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:58,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:58,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {17954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-08 10:07:58,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-08 10:07:58,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-08 10:07:58,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {17937#true} call ULTIMATE.init(); {17954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:58,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {17954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-08 10:07:58,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-08 10:07:58,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-08 10:07:58,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {17937#true} call #t~ret17 := main(); {17937#true} is VALID [2022-04-08 10:07:58,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {17937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17942#(= main_~y~0 0)} is VALID [2022-04-08 10:07:58,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {17942#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:58,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {17943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:58,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {17944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:58,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {17945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:58,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {17946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:58,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {17947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:58,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {17948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:58,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {17949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17950#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:58,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {17950#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17951#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:58,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {17951#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:58,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:58,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {17953#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {17953#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#false} assume !(~x~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {17938#false} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L272 TraceCheckUtils]: 23: Hoare triple {17938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {17938#false} ~cond := #in~cond; {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {17938#false} assume 0 == ~cond; {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {17938#false} assume !false; {17938#false} is VALID [2022-04-08 10:07:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:58,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:58,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495926187] [2022-04-08 10:07:58,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495926187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:58,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306494368] [2022-04-08 10:07:58,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:58,682 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:58,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 10:07:58,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:58,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:58,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:07:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:58,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:58,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {17937#true} call ULTIMATE.init(); {17937#true} is VALID [2022-04-08 10:07:58,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {17937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-08 10:07:58,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-08 10:07:58,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-08 10:07:58,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {17937#true} call #t~ret17 := main(); {17937#true} is VALID [2022-04-08 10:07:58,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {17937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17942#(= main_~y~0 0)} is VALID [2022-04-08 10:07:58,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {17942#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:58,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {17943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:58,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {17944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:58,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {17945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:58,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {17946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:58,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {17947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:58,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {17948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:58,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {17949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17950#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:58,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {17950#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17951#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:58,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {17951#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:58,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:58,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {17952#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {18009#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:58,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {18009#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#false} assume !(~x~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {17938#false} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:58,944 INFO L272 TraceCheckUtils]: 23: Hoare triple {17938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17938#false} is VALID [2022-04-08 10:07:58,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {17938#false} ~cond := #in~cond; {17938#false} is VALID [2022-04-08 10:07:58,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {17938#false} assume 0 == ~cond; {17938#false} is VALID [2022-04-08 10:07:58,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {17938#false} assume !false; {17938#false} is VALID [2022-04-08 10:07:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:58,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:59,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {17938#false} assume !false; {17938#false} is VALID [2022-04-08 10:07:59,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {17938#false} assume 0 == ~cond; {17938#false} is VALID [2022-04-08 10:07:59,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {17938#false} ~cond := #in~cond; {17938#false} is VALID [2022-04-08 10:07:59,208 INFO L272 TraceCheckUtils]: 23: Hoare triple {17938#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17938#false} is VALID [2022-04-08 10:07:59,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:59,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {17938#false} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:59,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#false} assume !(~x~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:59,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {17938#false} assume !(~y~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:59,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {18061#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17938#false} is VALID [2022-04-08 10:07:59,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {18065#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {18061#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:59,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {18065#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18065#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:59,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18065#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:59,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {18076#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18072#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:59,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {18080#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18076#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:59,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {18084#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18080#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:59,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {18088#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18084#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:59,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {18092#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18088#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:59,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {18096#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18092#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:59,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {18100#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18096#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:59,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {18104#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18100#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:59,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {18108#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18104#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:59,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {17937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18108#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:59,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {17937#true} call #t~ret17 := main(); {17937#true} is VALID [2022-04-08 10:07:59,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17937#true} {17937#true} #94#return; {17937#true} is VALID [2022-04-08 10:07:59,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {17937#true} assume true; {17937#true} is VALID [2022-04-08 10:07:59,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {17937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17937#true} is VALID [2022-04-08 10:07:59,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {17937#true} call ULTIMATE.init(); {17937#true} is VALID [2022-04-08 10:07:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:59,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306494368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:59,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:59,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:07:59,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:59,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843354000] [2022-04-08 10:07:59,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843354000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:59,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:59,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:07:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002956562] [2022-04-08 10:07:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:59,217 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-08 10:07:59,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:59,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-08 10:07:59,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:59,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:07:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:07:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:07:59,233 INFO L87 Difference]: Start difference. First operand 214 states and 291 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-08 10:08:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:01,971 INFO L93 Difference]: Finished difference Result 313 states and 469 transitions. [2022-04-08 10:08:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:08:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-08 10:08:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-08 10:08:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 173 transitions. [2022-04-08 10:08:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-08 10:08:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 173 transitions. [2022-04-08 10:08:01,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 173 transitions. [2022-04-08 10:08:02,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:02,097 INFO L225 Difference]: With dead ends: 313 [2022-04-08 10:08:02,097 INFO L226 Difference]: Without dead ends: 297 [2022-04-08 10:08:02,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:08:02,098 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 141 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:02,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 131 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:08:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-08 10:08:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 232. [2022-04-08 10:08:02,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:02,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,759 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,760 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:02,763 INFO L93 Difference]: Finished difference Result 297 states and 402 transitions. [2022-04-08 10:08:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 402 transitions. [2022-04-08 10:08:02,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:02,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:02,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 states have internal predecessors, (313), 3 states have call successors, (3), 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 297 states. [2022-04-08 10:08:02,764 INFO L87 Difference]: Start difference. First operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 states have internal predecessors, (313), 3 states have call successors, (3), 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 297 states. [2022-04-08 10:08:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:02,767 INFO L93 Difference]: Finished difference Result 297 states and 402 transitions. [2022-04-08 10:08:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 402 transitions. [2022-04-08 10:08:02,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:02,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:02,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:02,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.3788546255506609) internal successors, (313), 227 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2022-04-08 10:08:02,771 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 317 transitions. Word has length 27 [2022-04-08 10:08:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:02,771 INFO L478 AbstractCegarLoop]: Abstraction has 232 states and 317 transitions. [2022-04-08 10:08:02,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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-08 10:08:02,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 317 transitions. [2022-04-08 10:08:03,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 317 transitions. [2022-04-08 10:08:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:08:03,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:03,266 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:03,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:03,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:03,467 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash -184866059, now seen corresponding path program 3 times [2022-04-08 10:08:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:03,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265940754] [2022-04-08 10:08:03,469 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:03,469 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash -184866059, now seen corresponding path program 4 times [2022-04-08 10:08:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:03,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296723284] [2022-04-08 10:08:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:03,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {19849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-08 10:08:03,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-08 10:08:03,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-08 10:08:03,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {19837#true} call ULTIMATE.init(); {19849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:03,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {19849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-08 10:08:03,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-08 10:08:03,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-08 10:08:03,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {19837#true} call #t~ret17 := main(); {19837#true} is VALID [2022-04-08 10:08:03,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {19837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19842#(= main_~y~0 0)} is VALID [2022-04-08 10:08:03,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {19842#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19843#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:03,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {19843#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19844#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:03,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {19844#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19845#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:03,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {19845#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:03,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:03,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {19847#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:03,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {19847#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19848#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {19848#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {19838#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {19838#false} assume !(~x~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {19838#false} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L272 TraceCheckUtils]: 24: Hoare triple {19838#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19838#false} is VALID [2022-04-08 10:08:03,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {19838#false} ~cond := #in~cond; {19838#false} is VALID [2022-04-08 10:08:03,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {19838#false} assume 0 == ~cond; {19838#false} is VALID [2022-04-08 10:08:03,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {19838#false} assume !false; {19838#false} is VALID [2022-04-08 10:08:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:08:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296723284] [2022-04-08 10:08:03,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296723284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821153093] [2022-04-08 10:08:03,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:03,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:03,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:03,600 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:03,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 10:08:03,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:03,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:03,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:08:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:03,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:03,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {19837#true} call ULTIMATE.init(); {19837#true} is VALID [2022-04-08 10:08:03,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {19837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-08 10:08:03,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-08 10:08:03,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-08 10:08:03,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {19837#true} call #t~ret17 := main(); {19837#true} is VALID [2022-04-08 10:08:03,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {19837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19842#(= main_~y~0 0)} is VALID [2022-04-08 10:08:03,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {19842#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19843#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:03,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {19843#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19844#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:03,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {19844#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19845#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:03,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {19845#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:03,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:03,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {19846#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {19886#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:03,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {19886#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19890#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:08:03,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {19890#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {19838#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {19838#false} assume !(~x~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {19838#false} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L272 TraceCheckUtils]: 24: Hoare triple {19838#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {19838#false} ~cond := #in~cond; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {19838#false} assume 0 == ~cond; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {19838#false} assume !false; {19838#false} is VALID [2022-04-08 10:08:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:08:03,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:03,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {19838#false} assume !false; {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {19838#false} assume 0 == ~cond; {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {19838#false} ~cond := #in~cond; {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L272 TraceCheckUtils]: 24: Hoare triple {19838#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {19838#false} assume !(~z~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {19838#false} assume !(~x~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {19838#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {19838#false} assume !(~y~0 % 4294967296 > 0); {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {19838#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {19972#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19838#false} is VALID [2022-04-08 10:08:03,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {19976#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19972#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:03,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {19980#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19976#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:08:03,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {19984#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19980#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:08:03,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {19837#true} ~z~0 := ~y~0; {19984#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:08:03,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {19837#true} assume !(~x~0 % 4294967296 > 0); {19837#true} is VALID [2022-04-08 10:08:03,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-08 10:08:03,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {19837#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {19837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {19837#true} call #t~ret17 := main(); {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19837#true} {19837#true} #94#return; {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {19837#true} assume true; {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {19837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {19837#true} call ULTIMATE.init(); {19837#true} is VALID [2022-04-08 10:08:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:08:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821153093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:03,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:03,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-08 10:08:03,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:03,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265940754] [2022-04-08 10:08:03,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265940754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:03,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:03,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:08:03,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137402440] [2022-04-08 10:08:03,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:03,909 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 28 [2022-04-08 10:08:03,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:03,910 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-08 10:08:03,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:03,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:08:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:08:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:08:03,933 INFO L87 Difference]: Start difference. First operand 232 states and 317 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-08 10:08:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:05,232 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-04-08 10:08:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:08:05,232 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 28 [2022-04-08 10:08:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:05,232 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-08 10:08:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-08 10:08:05,233 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-08 10:08:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-08 10:08:05,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2022-04-08 10:08:05,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:05,295 INFO L225 Difference]: With dead ends: 275 [2022-04-08 10:08:05,295 INFO L226 Difference]: Without dead ends: 260 [2022-04-08 10:08:05,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:08:05,296 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:05,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 69 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:08:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-04-08 10:08:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 232. [2022-04-08 10:08:05,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:05,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:05,942 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:05,942 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:05,945 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2022-04-08 10:08:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2022-04-08 10:08:05,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:05,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:05,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 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 260 states. [2022-04-08 10:08:05,945 INFO L87 Difference]: Start difference. First operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 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 260 states. [2022-04-08 10:08:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:05,948 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2022-04-08 10:08:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2022-04-08 10:08:05,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:05,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:05,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:05,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 227 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2022-04-08 10:08:05,952 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 28 [2022-04-08 10:08:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:05,952 INFO L478 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2022-04-08 10:08:05,952 INFO L479 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-08 10:08:05,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 316 transitions. [2022-04-08 10:08:06,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2022-04-08 10:08:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:08:06,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:06,397 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:06,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:06,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:06,604 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1906006827, now seen corresponding path program 7 times [2022-04-08 10:08:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:06,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [694727599] [2022-04-08 10:08:06,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:06,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1906006827, now seen corresponding path program 8 times [2022-04-08 10:08:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:06,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053075341] [2022-04-08 10:08:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:06,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {21587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-08 10:08:06,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-08 10:08:06,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-08 10:08:06,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:06,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {21587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-08 10:08:06,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-08 10:08:06,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-08 10:08:06,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret17 := main(); {21573#true} is VALID [2022-04-08 10:08:06,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21578#(= main_~y~0 0)} is VALID [2022-04-08 10:08:06,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {21578#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21579#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:06,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {21579#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21580#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:06,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {21580#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21581#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:06,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {21581#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:06,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:06,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {21582#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {21583#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:06,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {21583#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21584#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:06,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {21584#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21585#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {21585#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21586#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {21586#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {21574#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21574#false} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {21574#false} assume !(~x~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {21574#false} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,740 INFO L272 TraceCheckUtils]: 24: Hoare triple {21574#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21574#false} is VALID [2022-04-08 10:08:06,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {21574#false} ~cond := #in~cond; {21574#false} is VALID [2022-04-08 10:08:06,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {21574#false} assume 0 == ~cond; {21574#false} is VALID [2022-04-08 10:08:06,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-08 10:08:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:08:06,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053075341] [2022-04-08 10:08:06,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053075341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137149307] [2022-04-08 10:08:06,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:06,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:06,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:06,741 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:06,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 10:08:06,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:06,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:06,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:08:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:06,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:06,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21573#true} is VALID [2022-04-08 10:08:06,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-08 10:08:06,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-08 10:08:06,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-08 10:08:06,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret17 := main(); {21573#true} is VALID [2022-04-08 10:08:06,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21573#true} is VALID [2022-04-08 10:08:06,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21573#true} is VALID [2022-04-08 10:08:06,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:06,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:06,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:06,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:06,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:06,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:06,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:06,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:06,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:06,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:06,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:06,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:06,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:06,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:06,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {21574#false} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:06,941 INFO L272 TraceCheckUtils]: 24: Hoare triple {21574#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21574#false} is VALID [2022-04-08 10:08:06,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {21574#false} ~cond := #in~cond; {21574#false} is VALID [2022-04-08 10:08:06,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {21574#false} assume 0 == ~cond; {21574#false} is VALID [2022-04-08 10:08:06,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-08 10:08:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:08:06,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:07,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-08 10:08:07,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {21574#false} assume 0 == ~cond; {21574#false} is VALID [2022-04-08 10:08:07,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {21574#false} ~cond := #in~cond; {21574#false} is VALID [2022-04-08 10:08:07,025 INFO L272 TraceCheckUtils]: 24: Hoare triple {21574#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21574#false} is VALID [2022-04-08 10:08:07,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {21574#false} assume !(~y~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:07,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {21574#false} assume !(~z~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:07,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21574#false} is VALID [2022-04-08 10:08:07,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:07,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:07,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:07,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:07,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:07,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:07,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21636#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:07,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:07,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:07,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:07,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:07,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21620#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:07,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21616#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:07,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21612#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:07,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {21573#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21573#true} is VALID [2022-04-08 10:08:07,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21573#true} is VALID [2022-04-08 10:08:07,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret17 := main(); {21573#true} is VALID [2022-04-08 10:08:07,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #94#return; {21573#true} is VALID [2022-04-08 10:08:07,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-08 10:08:07,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21573#true} is VALID [2022-04-08 10:08:07,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21573#true} is VALID [2022-04-08 10:08:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:08:07,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137149307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:07,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:07,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-08 10:08:07,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:07,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [694727599] [2022-04-08 10:08:07,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [694727599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:07,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:07,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:08:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558386748] [2022-04-08 10:08:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 28 [2022-04-08 10:08:07,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:07,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:08:07,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:07,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:08:07,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:07,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:08:07,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:08:07,053 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:08:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:08,570 INFO L93 Difference]: Finished difference Result 307 states and 426 transitions. [2022-04-08 10:08:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:08:08,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 28 [2022-04-08 10:08:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:08:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-08 10:08:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:08:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2022-04-08 10:08:08,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 92 transitions. [2022-04-08 10:08:08,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:08,638 INFO L225 Difference]: With dead ends: 307 [2022-04-08 10:08:08,638 INFO L226 Difference]: Without dead ends: 254 [2022-04-08 10:08:08,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:08:08,639 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:08,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 75 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:08:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-08 10:08:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 233. [2022-04-08 10:08:09,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:09,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,314 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,314 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:09,317 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2022-04-08 10:08:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 347 transitions. [2022-04-08 10:08:09,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:09,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:09,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 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 254 states. [2022-04-08 10:08:09,318 INFO L87 Difference]: Start difference. First operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 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 254 states. [2022-04-08 10:08:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:09,320 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2022-04-08 10:08:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 347 transitions. [2022-04-08 10:08:09,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:09,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:09,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:09,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.368421052631579) internal successors, (312), 228 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2022-04-08 10:08:09,325 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 28 [2022-04-08 10:08:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:09,325 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2022-04-08 10:08:09,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-08 10:08:09,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 316 transitions. [2022-04-08 10:08:09,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2022-04-08 10:08:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:08:09,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:09,801 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:09,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-08 10:08:10,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 10:08:10,002 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1554538282, now seen corresponding path program 21 times [2022-04-08 10:08:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:10,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127156753] [2022-04-08 10:08:10,004 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:10,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1554538282, now seen corresponding path program 22 times [2022-04-08 10:08:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:10,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583176012] [2022-04-08 10:08:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {23393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-08 10:08:10,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-08 10:08:10,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-08 10:08:10,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {23375#true} call ULTIMATE.init(); {23393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:10,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {23393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-08 10:08:10,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-08 10:08:10,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-08 10:08:10,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {23375#true} call #t~ret17 := main(); {23375#true} is VALID [2022-04-08 10:08:10,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {23375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23380#(= main_~y~0 0)} is VALID [2022-04-08 10:08:10,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {23380#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23381#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:10,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {23381#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23382#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:10,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {23382#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23383#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:10,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {23383#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23384#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:10,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23385#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:10,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {23385#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23386#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:10,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {23386#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23387#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:10,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {23387#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23388#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:10,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {23388#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23389#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:10,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {23389#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:10,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {23390#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:10,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:10,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {23392#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {23392#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#false} assume !(~x~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {23376#false} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L272 TraceCheckUtils]: 24: Hoare triple {23376#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {23376#false} ~cond := #in~cond; {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {23376#false} assume 0 == ~cond; {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {23376#false} assume !false; {23376#false} is VALID [2022-04-08 10:08:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:10,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583176012] [2022-04-08 10:08:10,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583176012] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975269368] [2022-04-08 10:08:10,195 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:10,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:10,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:10,196 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:10,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 10:08:10,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:10,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:10,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:08:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:10,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {23375#true} call ULTIMATE.init(); {23375#true} is VALID [2022-04-08 10:08:10,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {23375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-08 10:08:10,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-08 10:08:10,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-08 10:08:10,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {23375#true} call #t~ret17 := main(); {23375#true} is VALID [2022-04-08 10:08:10,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {23375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23380#(= main_~y~0 0)} is VALID [2022-04-08 10:08:10,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {23380#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23381#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:10,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {23381#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23382#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:10,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {23382#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23383#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:10,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {23383#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23384#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:10,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {23384#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23385#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:10,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {23385#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23386#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:10,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {23386#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23387#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:10,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {23387#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23388#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:10,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {23388#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23389#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:10,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {23389#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23390#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:10,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {23390#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:10,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:10,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {23391#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {23451#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:10,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {23451#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#false} assume !(~x~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {23376#false} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,459 INFO L272 TraceCheckUtils]: 24: Hoare triple {23376#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23376#false} is VALID [2022-04-08 10:08:10,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {23376#false} ~cond := #in~cond; {23376#false} is VALID [2022-04-08 10:08:10,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {23376#false} assume 0 == ~cond; {23376#false} is VALID [2022-04-08 10:08:10,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {23376#false} assume !false; {23376#false} is VALID [2022-04-08 10:08:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:10,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:10,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {23376#false} assume !false; {23376#false} is VALID [2022-04-08 10:08:10,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {23376#false} assume 0 == ~cond; {23376#false} is VALID [2022-04-08 10:08:10,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {23376#false} ~cond := #in~cond; {23376#false} is VALID [2022-04-08 10:08:10,760 INFO L272 TraceCheckUtils]: 24: Hoare triple {23376#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23376#false} is VALID [2022-04-08 10:08:10,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {23376#false} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#false} assume !(~x~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {23376#false} assume !(~y~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {23503#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23376#false} is VALID [2022-04-08 10:08:10,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {23507#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {23503#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:10,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {23507#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {23507#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:10,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {23514#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23507#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:10,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {23518#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23514#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:10,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {23522#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23518#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:10,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {23526#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23522#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:10,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {23530#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23526#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:10,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {23534#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23530#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:10,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {23538#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23534#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:10,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {23542#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23538#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:10,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {23546#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23542#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:10,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {23550#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23546#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:10,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {23554#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23550#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:10,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {23375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23554#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:10,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {23375#true} call #t~ret17 := main(); {23375#true} is VALID [2022-04-08 10:08:10,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23375#true} {23375#true} #94#return; {23375#true} is VALID [2022-04-08 10:08:10,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {23375#true} assume true; {23375#true} is VALID [2022-04-08 10:08:10,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {23375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23375#true} is VALID [2022-04-08 10:08:10,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {23375#true} call ULTIMATE.init(); {23375#true} is VALID [2022-04-08 10:08:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:10,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975269368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:10,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:10,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:08:10,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:10,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127156753] [2022-04-08 10:08:10,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127156753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:10,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:10,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458710744] [2022-04-08 10:08:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:10,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:08:10,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:10,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:10,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:10,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:10,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:08:10,787 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:13,888 INFO L93 Difference]: Finished difference Result 338 states and 506 transitions. [2022-04-08 10:08:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:08:13,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 10:08:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 186 transitions. [2022-04-08 10:08:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 186 transitions. [2022-04-08 10:08:13,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 186 transitions. [2022-04-08 10:08:14,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:14,027 INFO L225 Difference]: With dead ends: 338 [2022-04-08 10:08:14,027 INFO L226 Difference]: Without dead ends: 322 [2022-04-08 10:08:14,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:08:14,028 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 155 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:14,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 142 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:08:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-08 10:08:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 251. [2022-04-08 10:08:14,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:14,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:14,744 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:14,744 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:14,748 INFO L93 Difference]: Finished difference Result 322 states and 435 transitions. [2022-04-08 10:08:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 435 transitions. [2022-04-08 10:08:14,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:14,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:14,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 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 322 states. [2022-04-08 10:08:14,749 INFO L87 Difference]: Start difference. First operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 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 322 states. [2022-04-08 10:08:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:14,752 INFO L93 Difference]: Finished difference Result 322 states and 435 transitions. [2022-04-08 10:08:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 435 transitions. [2022-04-08 10:08:14,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:14,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:14,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:14,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 246 states have (on average 1.3739837398373984) internal successors, (338), 246 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 342 transitions. [2022-04-08 10:08:14,756 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 342 transitions. Word has length 28 [2022-04-08 10:08:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:14,756 INFO L478 AbstractCegarLoop]: Abstraction has 251 states and 342 transitions. [2022-04-08 10:08:14,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:14,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 251 states and 342 transitions. [2022-04-08 10:08:15,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 342 transitions. [2022-04-08 10:08:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:08:15,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:15,255 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:15,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:15,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-08 10:08:15,479 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 5 times [2022-04-08 10:08:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:15,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281261300] [2022-04-08 10:08:15,481 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:15,481 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 6 times [2022-04-08 10:08:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:15,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223489961] [2022-04-08 10:08:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:15,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {25438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-08 10:08:15,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-08 10:08:15,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-08 10:08:15,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {25423#true} call ULTIMATE.init(); {25438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:15,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {25438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-08 10:08:15,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-08 10:08:15,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-08 10:08:15,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {25423#true} call #t~ret17 := main(); {25423#true} is VALID [2022-04-08 10:08:15,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {25423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:08:15,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25429#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:15,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {25429#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25430#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-08 10:08:15,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {25430#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {25431#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:15,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {25431#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:15,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:15,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:15,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:15,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:15,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~x~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:15,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-08 10:08:15,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:15,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:15,808 INFO L272 TraceCheckUtils]: 25: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25436#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:08:15,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {25436#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25437#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:08:15,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {25437#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25424#false} is VALID [2022-04-08 10:08:15,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {25424#false} assume !false; {25424#false} is VALID [2022-04-08 10:08:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:08:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:15,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223489961] [2022-04-08 10:08:15,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223489961] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:15,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802212936] [2022-04-08 10:08:15,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:15,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:15,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:15,811 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:15,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 10:08:15,881 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-08 10:08:15,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:15,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-08 10:08:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:15,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:40,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {25423#true} call ULTIMATE.init(); {25423#true} is VALID [2022-04-08 10:08:40,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {25423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-08 10:08:40,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-08 10:08:40,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-08 10:08:40,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {25423#true} call #t~ret17 := main(); {25423#true} is VALID [2022-04-08 10:08:40,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {25423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:08:40,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {25428#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25460#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 10:08:40,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {25460#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25464#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:40,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {25464#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {25468#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:40,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {25468#(and (= (+ (- 2) main_~y~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:40,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25476#(and (= 2 (+ main_~z~0 1)) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:08:40,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {25476#(and (= 2 (+ main_~z~0 1)) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} is VALID [2022-04-08 10:08:40,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} is VALID [2022-04-08 10:08:40,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {25480#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= 2 (+ main_~z~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25487#(and (= 2 (+ main_~z~0 1)) (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:08:40,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {25487#(and (= 2 (+ main_~z~0 1)) (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~0 2))} is VALID [2022-04-08 10:08:40,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~0 2))} is VALID [2022-04-08 10:08:40,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {25491#(and (= main_~n~0 main_~x~0) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))) (= main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25498#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ main_~n~0 4294967294) 4294967296) 0) (= main_~z~0 2))} is VALID [2022-04-08 10:08:40,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {25498#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ main_~n~0 4294967294) 4294967296) 0) (= main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:40,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {25472#(and (= (+ (- 2) main_~z~0) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:40,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-08 10:08:40,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-08 10:08:40,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-08 10:08:40,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {25434#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-08 10:08:40,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {25433#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:40,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-08 10:08:40,260 INFO L272 TraceCheckUtils]: 25: Hoare triple {25432#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:40,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:40,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {25530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25424#false} is VALID [2022-04-08 10:08:40,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {25424#false} assume !false; {25424#false} is VALID [2022-04-08 10:08:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:40,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:41,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {25424#false} assume !false; {25424#false} is VALID [2022-04-08 10:08:41,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {25530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25424#false} is VALID [2022-04-08 10:08:41,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:41,199 INFO L272 TraceCheckUtils]: 25: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:41,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:41,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25435#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:41,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:41,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:08:41,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25556#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:08:41,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {25566#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25552#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:41,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {25566#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:08:41,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {25574#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:41,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25574#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:41,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:41,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {25585#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25578#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:41,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25585#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:08:41,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !(~z~0 % 4294967296 > 0); {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:08:41,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {25596#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25589#(or (<= (mod (+ main_~z~0 2) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:08:41,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25596#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (<= (mod (+ main_~z~0 1) 4294967296) 0))} is VALID [2022-04-08 10:08:41,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {25570#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:08:41,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:08:41,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {25610#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25603#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:08:41,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {25614#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25610#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-08 10:08:41,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {25423#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25614#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:08:41,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {25423#true} call #t~ret17 := main(); {25423#true} is VALID [2022-04-08 10:08:41,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25423#true} {25423#true} #94#return; {25423#true} is VALID [2022-04-08 10:08:41,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {25423#true} assume true; {25423#true} is VALID [2022-04-08 10:08:41,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {25423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25423#true} is VALID [2022-04-08 10:08:41,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {25423#true} call ULTIMATE.init(); {25423#true} is VALID [2022-04-08 10:08:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802212936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:41,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 36 [2022-04-08 10:08:41,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:41,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281261300] [2022-04-08 10:08:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281261300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:41,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:08:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981831138] [2022-04-08 10:08:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:41,219 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:08:41,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:41,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:41,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:41,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:08:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:08:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:08:41,276 INFO L87 Difference]: Start difference. First operand 251 states and 342 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:43,459 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2022-04-08 10:08:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:08:43,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:08:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-08 10:08:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-08 10:08:43,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 51 transitions. [2022-04-08 10:08:43,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:43,534 INFO L225 Difference]: With dead ends: 324 [2022-04-08 10:08:43,534 INFO L226 Difference]: Without dead ends: 313 [2022-04-08 10:08:43,535 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=286, Invalid=1970, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:08:43,535 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:43,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 69 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:08:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-08 10:08:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2022-04-08 10:08:44,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:44,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,319 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,320 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:44,323 INFO L93 Difference]: Finished difference Result 313 states and 405 transitions. [2022-04-08 10:08:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 405 transitions. [2022-04-08 10:08:44,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:44,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:44,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 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 313 states. [2022-04-08 10:08:44,324 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 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 313 states. [2022-04-08 10:08:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:44,328 INFO L93 Difference]: Finished difference Result 313 states and 405 transitions. [2022-04-08 10:08:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 405 transitions. [2022-04-08 10:08:44,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:44,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:44,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:44,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.369047619047619) internal successors, (345), 252 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 349 transitions. [2022-04-08 10:08:44,332 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 349 transitions. Word has length 29 [2022-04-08 10:08:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:44,332 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 349 transitions. [2022-04-08 10:08:44,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:44,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 349 transitions. [2022-04-08 10:08:45,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 349 transitions. [2022-04-08 10:08:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:08:45,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:45,225 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:45,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:45,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:45,426 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash -571931592, now seen corresponding path program 5 times [2022-04-08 10:08:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:45,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693358697] [2022-04-08 10:08:45,428 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:45,428 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash -571931592, now seen corresponding path program 6 times [2022-04-08 10:08:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:45,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265774491] [2022-04-08 10:08:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {27458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-08 10:08:45,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-08 10:08:45,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-08 10:08:45,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {27447#true} call ULTIMATE.init(); {27458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:45,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {27458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-08 10:08:45,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-08 10:08:45,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-08 10:08:45,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {27447#true} call #t~ret17 := main(); {27447#true} is VALID [2022-04-08 10:08:45,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {27447#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27447#true} is VALID [2022-04-08 10:08:45,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {27447#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:45,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27453#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:08:45,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {27453#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:08:45,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:08:45,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:08:45,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {27454#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27455#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:08:45,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {27455#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27456#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:08:45,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {27456#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:45,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:45,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:45,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:45,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:45,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {27457#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {27448#false} assume !(~z~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {27448#false} assume !(~y~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L272 TraceCheckUtils]: 25: Hoare triple {27448#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {27448#false} ~cond := #in~cond; {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {27448#false} assume 0 == ~cond; {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {27448#false} assume !false; {27448#false} is VALID [2022-04-08 10:08:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:08:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265774491] [2022-04-08 10:08:45,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265774491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680715669] [2022-04-08 10:08:45,522 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:45,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:45,523 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:45,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 10:08:45,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:08:45,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:45,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:08:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:45,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:45,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {27447#true} call ULTIMATE.init(); {27447#true} is VALID [2022-04-08 10:08:45,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {27447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-08 10:08:45,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-08 10:08:45,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-08 10:08:45,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {27447#true} call #t~ret17 := main(); {27447#true} is VALID [2022-04-08 10:08:45,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {27447#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27447#true} is VALID [2022-04-08 10:08:45,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {27447#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:45,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:45,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:45,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:45,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {27448#false} assume !(~z~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {27448#false} assume !(~y~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L272 TraceCheckUtils]: 25: Hoare triple {27448#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {27448#false} ~cond := #in~cond; {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {27448#false} assume 0 == ~cond; {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {27448#false} assume !false; {27448#false} is VALID [2022-04-08 10:08:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:08:45,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:45,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {27448#false} assume !false; {27448#false} is VALID [2022-04-08 10:08:45,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {27448#false} assume 0 == ~cond; {27448#false} is VALID [2022-04-08 10:08:45,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {27448#false} ~cond := #in~cond; {27448#false} is VALID [2022-04-08 10:08:45,879 INFO L272 TraceCheckUtils]: 25: Hoare triple {27448#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27448#false} is VALID [2022-04-08 10:08:45,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {27448#false} assume !(~y~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {27448#false} assume !(~z~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {27448#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {27448#false} is VALID [2022-04-08 10:08:45,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27448#false} is VALID [2022-04-08 10:08:45,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27503#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:45,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:45,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27487#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:08:45,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27483#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:08:45,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {27447#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27452#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:08:45,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {27447#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27447#true} is VALID [2022-04-08 10:08:45,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {27447#true} call #t~ret17 := main(); {27447#true} is VALID [2022-04-08 10:08:45,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27447#true} {27447#true} #94#return; {27447#true} is VALID [2022-04-08 10:08:45,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {27447#true} assume true; {27447#true} is VALID [2022-04-08 10:08:45,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {27447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27447#true} is VALID [2022-04-08 10:08:45,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {27447#true} call ULTIMATE.init(); {27447#true} is VALID [2022-04-08 10:08:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:08:45,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680715669] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:45,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:45,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-08 10:08:45,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693358697] [2022-04-08 10:08:45,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693358697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:45,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:45,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:08:45,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746525203] [2022-04-08 10:08:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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 29 [2022-04-08 10:08:45,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:45,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-08 10:08:45,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:45,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:08:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:08:45,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:08:45,912 INFO L87 Difference]: Start difference. First operand 257 states and 349 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-08 10:08:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:48,147 INFO L93 Difference]: Finished difference Result 436 states and 607 transitions. [2022-04-08 10:08:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:08:48,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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 29 [2022-04-08 10:08:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-08 10:08:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-04-08 10:08:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-08 10:08:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-04-08 10:08:48,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2022-04-08 10:08:48,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:48,225 INFO L225 Difference]: With dead ends: 436 [2022-04-08 10:08:48,225 INFO L226 Difference]: Without dead ends: 411 [2022-04-08 10:08:48,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:08:48,226 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:48,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 61 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:08:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-08 10:08:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 270. [2022-04-08 10:08:49,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:49,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:49,138 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:49,138 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:49,144 INFO L93 Difference]: Finished difference Result 411 states and 569 transitions. [2022-04-08 10:08:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 569 transitions. [2022-04-08 10:08:49,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:49,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:49,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 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 411 states. [2022-04-08 10:08:49,145 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 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 411 states. [2022-04-08 10:08:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:49,150 INFO L93 Difference]: Finished difference Result 411 states and 569 transitions. [2022-04-08 10:08:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 569 transitions. [2022-04-08 10:08:49,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:49,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:49,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:49,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 265 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 368 transitions. [2022-04-08 10:08:49,155 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 368 transitions. Word has length 29 [2022-04-08 10:08:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:49,155 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 368 transitions. [2022-04-08 10:08:49,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-08 10:08:49,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 368 transitions. [2022-04-08 10:08:50,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 368 transitions. [2022-04-08 10:08:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:08:50,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:50,047 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:50,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:50,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:50,247 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1025176473, now seen corresponding path program 9 times [2022-04-08 10:08:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:50,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1684526469] [2022-04-08 10:08:50,250 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:50,250 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1025176473, now seen corresponding path program 10 times [2022-04-08 10:08:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:50,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079200324] [2022-04-08 10:08:50,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {29897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-08 10:08:50,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-08 10:08:50,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-08 10:08:50,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {29881#true} call ULTIMATE.init(); {29897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:50,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {29897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-08 10:08:50,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-08 10:08:50,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-08 10:08:50,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {29881#true} call #t~ret17 := main(); {29881#true} is VALID [2022-04-08 10:08:50,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {29881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29886#(= main_~y~0 0)} is VALID [2022-04-08 10:08:50,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {29886#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:50,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {29887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:50,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {29888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:50,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {29889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:50,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:50,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {29890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {29891#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:50,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {29891#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29892#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:50,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {29892#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29893#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:50,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {29893#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29894#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:50,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {29894#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29895#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:08:50,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {29895#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {29895#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:08:50,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {29895#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29894#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:50,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {29894#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29893#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:50,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {29893#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29892#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:50,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {29892#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:50,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:50,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:50,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {29896#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {29882#false} assume !(~y~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,483 INFO L272 TraceCheckUtils]: 25: Hoare triple {29882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29882#false} is VALID [2022-04-08 10:08:50,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {29882#false} ~cond := #in~cond; {29882#false} is VALID [2022-04-08 10:08:50,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#false} assume 0 == ~cond; {29882#false} is VALID [2022-04-08 10:08:50,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {29882#false} assume !false; {29882#false} is VALID [2022-04-08 10:08:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079200324] [2022-04-08 10:08:50,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079200324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104339930] [2022-04-08 10:08:50,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:50,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:50,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:50,484 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:50,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 10:08:50,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:50,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:50,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:08:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:50,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {29881#true} call ULTIMATE.init(); {29881#true} is VALID [2022-04-08 10:08:50,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {29881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-08 10:08:50,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-08 10:08:50,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-08 10:08:50,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {29881#true} call #t~ret17 := main(); {29881#true} is VALID [2022-04-08 10:08:50,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {29881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29881#true} is VALID [2022-04-08 10:08:50,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {29881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:50,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:50,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:50,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:50,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:50,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:50,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:50,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:50,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:50,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {29882#false} assume !(~z~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {29882#false} assume !(~y~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,673 INFO L272 TraceCheckUtils]: 25: Hoare triple {29882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29882#false} is VALID [2022-04-08 10:08:50,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {29882#false} ~cond := #in~cond; {29882#false} is VALID [2022-04-08 10:08:50,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#false} assume 0 == ~cond; {29882#false} is VALID [2022-04-08 10:08:50,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {29882#false} assume !false; {29882#false} is VALID [2022-04-08 10:08:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:08:50,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:50,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {29882#false} assume !false; {29882#false} is VALID [2022-04-08 10:08:50,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#false} assume 0 == ~cond; {29882#false} is VALID [2022-04-08 10:08:50,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {29882#false} ~cond := #in~cond; {29882#false} is VALID [2022-04-08 10:08:50,772 INFO L272 TraceCheckUtils]: 25: Hoare triple {29882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29882#false} is VALID [2022-04-08 10:08:50,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {29882#false} assume !(~y~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {29882#false} assume !(~z~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29882#false} is VALID [2022-04-08 10:08:50,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {29950#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29950#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:50,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:50,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:50,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:50,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:50,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:50,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29931#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:50,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29927#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:08:50,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29923#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:50,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {29881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29919#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:50,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {29881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29881#true} is VALID [2022-04-08 10:08:50,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {29881#true} call #t~ret17 := main(); {29881#true} is VALID [2022-04-08 10:08:50,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29881#true} {29881#true} #94#return; {29881#true} is VALID [2022-04-08 10:08:50,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {29881#true} assume true; {29881#true} is VALID [2022-04-08 10:08:50,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {29881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29881#true} is VALID [2022-04-08 10:08:50,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {29881#true} call ULTIMATE.init(); {29881#true} is VALID [2022-04-08 10:08:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:08:50,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104339930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:50,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:50,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-08 10:08:50,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1684526469] [2022-04-08 10:08:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1684526469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:50,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:50,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:08:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797528964] [2022-04-08 10:08:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:08:50,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:50,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:50,803 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-08 10:08:50,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:08:50,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:50,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:08:50,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:08:50,804 INFO L87 Difference]: Start difference. First operand 270 states and 368 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:55,246 INFO L93 Difference]: Finished difference Result 477 states and 686 transitions. [2022-04-08 10:08:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 10:08:55,247 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:08:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 201 transitions. [2022-04-08 10:08:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 201 transitions. [2022-04-08 10:08:55,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 201 transitions. [2022-04-08 10:08:55,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:55,415 INFO L225 Difference]: With dead ends: 477 [2022-04-08 10:08:55,415 INFO L226 Difference]: Without dead ends: 427 [2022-04-08 10:08:55,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=2703, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:08:55,416 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 97 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:55,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 85 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:08:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-08 10:08:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 313. [2022-04-08 10:08:56,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:56,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:56,607 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:56,607 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:56,613 INFO L93 Difference]: Finished difference Result 427 states and 543 transitions. [2022-04-08 10:08:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 543 transitions. [2022-04-08 10:08:56,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:56,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:56,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 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 427 states. [2022-04-08 10:08:56,614 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 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 427 states. [2022-04-08 10:08:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:56,620 INFO L93 Difference]: Finished difference Result 427 states and 543 transitions. [2022-04-08 10:08:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 543 transitions. [2022-04-08 10:08:56,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:56,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:56,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:56,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 423 transitions. [2022-04-08 10:08:56,625 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 423 transitions. Word has length 29 [2022-04-08 10:08:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:56,625 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 423 transitions. [2022-04-08 10:08:56,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:56,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 423 transitions. [2022-04-08 10:08:57,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 423 transitions. [2022-04-08 10:08:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:08:57,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:57,637 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:57,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:57,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 10:08:57,838 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2080282713, now seen corresponding path program 23 times [2022-04-08 10:08:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:57,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920564137] [2022-04-08 10:08:57,840 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:57,840 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2080282713, now seen corresponding path program 24 times [2022-04-08 10:08:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:57,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612848810] [2022-04-08 10:08:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:58,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {32601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-08 10:08:58,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-08 10:08:58,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-08 10:08:58,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {32582#true} call ULTIMATE.init(); {32601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:58,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {32601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-08 10:08:58,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-08 10:08:58,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-08 10:08:58,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {32582#true} call #t~ret17 := main(); {32582#true} is VALID [2022-04-08 10:08:58,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {32582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32587#(= main_~y~0 0)} is VALID [2022-04-08 10:08:58,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {32587#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:58,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {32588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:58,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {32589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:58,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {32590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:58,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {32591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:58,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {32592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:58,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {32593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:58,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {32594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:58,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32596#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:58,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {32596#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32597#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:58,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {32597#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32598#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:58,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {32598#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:58,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {32600#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {32600#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {32583#false} assume !(~x~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {32583#false} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,069 INFO L272 TraceCheckUtils]: 25: Hoare triple {32583#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32583#false} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {32583#false} ~cond := #in~cond; {32583#false} is VALID [2022-04-08 10:08:58,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {32583#false} assume 0 == ~cond; {32583#false} is VALID [2022-04-08 10:08:58,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {32583#false} assume !false; {32583#false} is VALID [2022-04-08 10:08:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:58,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612848810] [2022-04-08 10:08:58,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612848810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:58,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68229120] [2022-04-08 10:08:58,070 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:58,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:58,071 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:58,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 10:08:58,144 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:08:58,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:58,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:08:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:58,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:58,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {32582#true} call ULTIMATE.init(); {32582#true} is VALID [2022-04-08 10:08:58,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {32582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-08 10:08:58,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-08 10:08:58,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-08 10:08:58,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {32582#true} call #t~ret17 := main(); {32582#true} is VALID [2022-04-08 10:08:58,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {32582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32587#(= main_~y~0 0)} is VALID [2022-04-08 10:08:58,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {32587#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:58,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {32588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:58,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {32589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:58,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {32590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:58,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {32591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:58,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {32592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:58,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {32593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:58,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {32594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:58,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32596#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:58,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {32596#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32597#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:58,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {32597#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32598#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:58,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {32598#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:58,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {32599#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {32662#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {32662#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {32583#false} assume !(~x~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {32583#false} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,423 INFO L272 TraceCheckUtils]: 25: Hoare triple {32583#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32583#false} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {32583#false} ~cond := #in~cond; {32583#false} is VALID [2022-04-08 10:08:58,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {32583#false} assume 0 == ~cond; {32583#false} is VALID [2022-04-08 10:08:58,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {32583#false} assume !false; {32583#false} is VALID [2022-04-08 10:08:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:58,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:58,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {32583#false} assume !false; {32583#false} is VALID [2022-04-08 10:08:58,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {32583#false} assume 0 == ~cond; {32583#false} is VALID [2022-04-08 10:08:58,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {32583#false} ~cond := #in~cond; {32583#false} is VALID [2022-04-08 10:08:58,811 INFO L272 TraceCheckUtils]: 25: Hoare triple {32583#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32583#false} is VALID [2022-04-08 10:08:58,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {32583#false} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {32583#false} assume !(~x~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {32583#false} assume !(~y~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {32714#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32583#false} is VALID [2022-04-08 10:08:58,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {32718#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {32714#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:58,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {32718#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32718#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:58,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {32725#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32718#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:58,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {32729#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32725#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:58,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {32733#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32729#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:58,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {32737#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32733#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:58,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {32741#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32737#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:58,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {32745#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32741#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:58,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {32749#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32745#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:58,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {32753#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32749#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:58,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {32757#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32753#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:58,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {32761#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32757#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:58,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {32765#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32761#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:58,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {32769#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32765#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:58,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {32582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32769#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:58,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {32582#true} call #t~ret17 := main(); {32582#true} is VALID [2022-04-08 10:08:58,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32582#true} {32582#true} #94#return; {32582#true} is VALID [2022-04-08 10:08:58,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {32582#true} assume true; {32582#true} is VALID [2022-04-08 10:08:58,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {32582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32582#true} is VALID [2022-04-08 10:08:58,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {32582#true} call ULTIMATE.init(); {32582#true} is VALID [2022-04-08 10:08:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:58,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68229120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:58,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:58,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:08:58,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:58,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920564137] [2022-04-08 10:08:58,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920564137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:58,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:58,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:08:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330432718] [2022-04-08 10:08:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:08:58,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:58,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:58,838 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-08 10:08:58,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:08:58,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:58,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:08:58,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:08:58,839 INFO L87 Difference]: Start difference. First operand 313 states and 423 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:03,169 INFO L93 Difference]: Finished difference Result 451 states and 670 transitions. [2022-04-08 10:09:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:09:03,169 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:09:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 199 transitions. [2022-04-08 10:09:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 199 transitions. [2022-04-08 10:09:03,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 199 transitions. [2022-04-08 10:09:03,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:03,324 INFO L225 Difference]: With dead ends: 451 [2022-04-08 10:09:03,324 INFO L226 Difference]: Without dead ends: 433 [2022-04-08 10:09:03,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:09:03,325 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 165 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:03,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 153 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 10:09:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-04-08 10:09:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 335. [2022-04-08 10:09:04,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:04,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,596 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,596 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:04,602 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2022-04-08 10:09:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 577 transitions. [2022-04-08 10:09:04,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:04,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:04,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 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 433 states. [2022-04-08 10:09:04,603 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 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 433 states. [2022-04-08 10:09:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:04,609 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2022-04-08 10:09:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 577 transitions. [2022-04-08 10:09:04,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:04,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:04,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:04,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.3666666666666667) internal successors, (451), 330 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2022-04-08 10:09:04,615 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 29 [2022-04-08 10:09:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:04,615 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2022-04-08 10:09:04,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:04,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 455 transitions. [2022-04-08 10:09:05,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2022-04-08 10:09:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:09:05,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:05,643 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:05,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:05,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:09:05,843 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1393943515, now seen corresponding path program 5 times [2022-04-08 10:09:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:05,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33442535] [2022-04-08 10:09:05,847 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:05,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:05,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1393943515, now seen corresponding path program 6 times [2022-04-08 10:09:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:05,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453988468] [2022-04-08 10:09:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:05,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {35269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-08 10:09:05,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-08 10:09:05,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-08 10:09:05,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {35256#true} call ULTIMATE.init(); {35269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:05,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {35269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-08 10:09:05,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-08 10:09:05,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-08 10:09:05,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {35256#true} call #t~ret17 := main(); {35256#true} is VALID [2022-04-08 10:09:05,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {35256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35261#(= main_~y~0 0)} is VALID [2022-04-08 10:09:05,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {35261#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:05,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {35262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:05,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {35263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:05,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {35264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:05,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {35265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:05,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:05,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:05,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35268#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {35268#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {35257#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {35257#false} assume !(~x~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {35257#false} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:05,979 INFO L272 TraceCheckUtils]: 26: Hoare triple {35257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35257#false} is VALID [2022-04-08 10:09:05,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {35257#false} ~cond := #in~cond; {35257#false} is VALID [2022-04-08 10:09:05,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {35257#false} assume 0 == ~cond; {35257#false} is VALID [2022-04-08 10:09:05,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {35257#false} assume !false; {35257#false} is VALID [2022-04-08 10:09:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 10:09:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453988468] [2022-04-08 10:09:05,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453988468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733885783] [2022-04-08 10:09:05,980 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:05,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:05,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:05,981 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 10:09:06,031 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:09:06,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:06,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:09:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:06,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:06,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {35256#true} call ULTIMATE.init(); {35256#true} is VALID [2022-04-08 10:09:06,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {35256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-08 10:09:06,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-08 10:09:06,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-08 10:09:06,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {35256#true} call #t~ret17 := main(); {35256#true} is VALID [2022-04-08 10:09:06,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {35256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35261#(= main_~y~0 0)} is VALID [2022-04-08 10:09:06,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {35261#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:06,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {35262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:06,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {35263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:06,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {35264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:06,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {35265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:06,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:06,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {35266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:06,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35312#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:06,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {35312#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {35312#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:06,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {35312#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:06,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {35267#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35322#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:06,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {35322#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35326#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:06,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {35326#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35330#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:06,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {35330#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:06,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~y~0 % 4294967296 > 0); {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:06,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:06,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~x~0 % 4294967296 > 0); {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:06,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {35334#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:06,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {35257#false} is VALID [2022-04-08 10:09:06,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:06,327 INFO L272 TraceCheckUtils]: 26: Hoare triple {35257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35257#false} is VALID [2022-04-08 10:09:06,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {35257#false} ~cond := #in~cond; {35257#false} is VALID [2022-04-08 10:09:06,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {35257#false} assume 0 == ~cond; {35257#false} is VALID [2022-04-08 10:09:06,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {35257#false} assume !false; {35257#false} is VALID [2022-04-08 10:09:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:06,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:06,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {35257#false} assume !false; {35257#false} is VALID [2022-04-08 10:09:06,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {35257#false} assume 0 == ~cond; {35257#false} is VALID [2022-04-08 10:09:06,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {35257#false} ~cond := #in~cond; {35257#false} is VALID [2022-04-08 10:09:06,603 INFO L272 TraceCheckUtils]: 26: Hoare triple {35257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35257#false} is VALID [2022-04-08 10:09:06,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {35257#false} assume !(~y~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:06,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {35257#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {35257#false} is VALID [2022-04-08 10:09:06,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {35383#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35257#false} is VALID [2022-04-08 10:09:06,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {35383#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:06,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {35383#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:06,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {35383#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:06,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {35396#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:06,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {35400#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35396#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:09:06,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {35404#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35400#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:09:06,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {35408#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35404#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:09:06,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {35412#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35408#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:09:06,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {35412#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {35412#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:06,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {35408#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35412#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:06,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} ~z~0 := ~y~0; {35408#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:09:06,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:06,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {35429#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35422#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:06,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {35433#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35429#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:06,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {35437#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35433#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:06,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {35441#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35437#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:06,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {35445#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35441#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:06,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {35256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35445#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:06,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {35256#true} call #t~ret17 := main(); {35256#true} is VALID [2022-04-08 10:09:06,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35256#true} {35256#true} #94#return; {35256#true} is VALID [2022-04-08 10:09:06,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {35256#true} assume true; {35256#true} is VALID [2022-04-08 10:09:06,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {35256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35256#true} is VALID [2022-04-08 10:09:06,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {35256#true} call ULTIMATE.init(); {35256#true} is VALID [2022-04-08 10:09:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:09:06,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733885783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:06,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:06,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 28 [2022-04-08 10:09:06,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [33442535] [2022-04-08 10:09:06,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [33442535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:06,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:06,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:09:06,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125972577] [2022-04-08 10:09:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:06,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:09:06,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:06,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:06,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:06,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:09:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:06,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:09:06,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:09:06,633 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:08,905 INFO L93 Difference]: Finished difference Result 393 states and 525 transitions. [2022-04-08 10:09:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:09:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:09:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-08 10:09:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-04-08 10:09:08,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 98 transitions. [2022-04-08 10:09:08,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:08,982 INFO L225 Difference]: With dead ends: 393 [2022-04-08 10:09:08,982 INFO L226 Difference]: Without dead ends: 377 [2022-04-08 10:09:08,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:09:08,982 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:08,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 82 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:09:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-08 10:09:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 335. [2022-04-08 10:09:10,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:10,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:10,272 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:10,272 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:10,276 INFO L93 Difference]: Finished difference Result 377 states and 508 transitions. [2022-04-08 10:09:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 508 transitions. [2022-04-08 10:09:10,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:10,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:10,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 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 377 states. [2022-04-08 10:09:10,277 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 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 377 states. [2022-04-08 10:09:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:10,282 INFO L93 Difference]: Finished difference Result 377 states and 508 transitions. [2022-04-08 10:09:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 508 transitions. [2022-04-08 10:09:10,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:10,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:10,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:10,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 330 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2022-04-08 10:09:10,288 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 30 [2022-04-08 10:09:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:10,288 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2022-04-08 10:09:10,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:10,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 454 transitions. [2022-04-08 10:09:11,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2022-04-08 10:09:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:09:11,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:11,433 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:11,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:11,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 10:09:11,634 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1204383434, now seen corresponding path program 25 times [2022-04-08 10:09:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:11,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [613479412] [2022-04-08 10:09:11,636 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:11,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1204383434, now seen corresponding path program 26 times [2022-04-08 10:09:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:11,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767259009] [2022-04-08 10:09:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:11,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {37714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-08 10:09:11,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-08 10:09:11,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-08 10:09:11,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {37694#true} call ULTIMATE.init(); {37714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:11,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {37714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-08 10:09:11,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-08 10:09:11,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-08 10:09:11,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {37694#true} call #t~ret17 := main(); {37694#true} is VALID [2022-04-08 10:09:11,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {37694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37699#(= main_~y~0 0)} is VALID [2022-04-08 10:09:11,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {37699#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37700#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:11,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {37700#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37701#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:11,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {37701#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37702#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:11,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {37702#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37703#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:11,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {37703#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37704#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:11,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {37704#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37705#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:11,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {37705#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37706#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:11,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {37706#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37707#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:11,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {37707#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37708#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:11,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {37708#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37709#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:11,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {37709#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37710#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:11,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {37710#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37711#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:11,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {37711#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:11,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:11,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {37713#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {37713#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {37695#false} assume !(~x~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {37695#false} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L272 TraceCheckUtils]: 26: Hoare triple {37695#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {37695#false} ~cond := #in~cond; {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {37695#false} assume 0 == ~cond; {37695#false} is VALID [2022-04-08 10:09:11,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {37695#false} assume !false; {37695#false} is VALID [2022-04-08 10:09:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:11,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:11,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767259009] [2022-04-08 10:09:11,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767259009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:11,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486714131] [2022-04-08 10:09:11,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:11,894 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:11,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 10:09:11,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:11,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:11,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:09:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:11,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:12,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {37694#true} call ULTIMATE.init(); {37694#true} is VALID [2022-04-08 10:09:12,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {37694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-08 10:09:12,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-08 10:09:12,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-08 10:09:12,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {37694#true} call #t~ret17 := main(); {37694#true} is VALID [2022-04-08 10:09:12,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {37694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37699#(= main_~y~0 0)} is VALID [2022-04-08 10:09:12,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {37699#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37700#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:12,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {37700#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37701#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:12,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {37701#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37702#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:12,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {37702#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37703#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:12,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {37703#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37704#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:12,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {37704#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37705#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:12,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {37705#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37706#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:12,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {37706#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37707#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:12,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {37707#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37708#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:12,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {37708#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37709#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:12,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {37709#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37710#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:12,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {37710#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37711#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:12,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {37711#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:12,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:12,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {37712#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {37778#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {37778#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {37695#false} assume !(~x~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {37695#false} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L272 TraceCheckUtils]: 26: Hoare triple {37695#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {37695#false} ~cond := #in~cond; {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {37695#false} assume 0 == ~cond; {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {37695#false} assume !false; {37695#false} is VALID [2022-04-08 10:09:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:12,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:12,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {37695#false} assume !false; {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {37695#false} assume 0 == ~cond; {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {37695#false} ~cond := #in~cond; {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L272 TraceCheckUtils]: 26: Hoare triple {37695#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {37695#false} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {37695#false} assume !(~x~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {37695#false} assume !(~y~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {37830#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {37695#false} is VALID [2022-04-08 10:09:12,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {37834#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {37830#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:12,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {37834#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {37834#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:12,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {37841#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37834#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:12,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {37845#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37841#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:12,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {37849#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37845#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:12,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {37853#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37849#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:12,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {37857#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37853#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:12,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {37861#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37857#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:12,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {37865#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37861#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:12,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {37869#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37865#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:12,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {37873#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37869#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:12,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {37877#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37873#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:12,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {37881#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37877#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:12,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {37885#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:12,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {37889#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37885#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:12,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {37694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37889#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:12,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {37694#true} call #t~ret17 := main(); {37694#true} is VALID [2022-04-08 10:09:12,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37694#true} {37694#true} #94#return; {37694#true} is VALID [2022-04-08 10:09:12,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {37694#true} assume true; {37694#true} is VALID [2022-04-08 10:09:12,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {37694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37694#true} is VALID [2022-04-08 10:09:12,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {37694#true} call ULTIMATE.init(); {37694#true} is VALID [2022-04-08 10:09:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:12,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486714131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:12,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:12,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:09:12,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:12,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [613479412] [2022-04-08 10:09:12,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [613479412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:12,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:12,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:09:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564185478] [2022-04-08 10:09:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:09:12,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:12,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:12,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:12,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:09:12,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:09:12,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:09:12,651 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:17,543 INFO L93 Difference]: Finished difference Result 480 states and 715 transitions. [2022-04-08 10:09:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:09:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 10:09:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 212 transitions. [2022-04-08 10:09:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 212 transitions. [2022-04-08 10:09:17,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 212 transitions. [2022-04-08 10:09:17,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:17,709 INFO L225 Difference]: With dead ends: 480 [2022-04-08 10:09:17,709 INFO L226 Difference]: Without dead ends: 462 [2022-04-08 10:09:17,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:09:17,710 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 183 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:17,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 164 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 10:09:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-08 10:09:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 357. [2022-04-08 10:09:19,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:19,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:19,067 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:19,067 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:19,074 INFO L93 Difference]: Finished difference Result 462 states and 617 transitions. [2022-04-08 10:09:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 617 transitions. [2022-04-08 10:09:19,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:19,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:19,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 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 462 states. [2022-04-08 10:09:19,075 INFO L87 Difference]: Start difference. First operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 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 462 states. [2022-04-08 10:09:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:19,085 INFO L93 Difference]: Finished difference Result 462 states and 617 transitions. [2022-04-08 10:09:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 617 transitions. [2022-04-08 10:09:19,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:19,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:19,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:19,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 352 states have (on average 1.3693181818181819) internal successors, (482), 352 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 486 transitions. [2022-04-08 10:09:19,091 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 486 transitions. Word has length 30 [2022-04-08 10:09:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:19,092 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 486 transitions. [2022-04-08 10:09:19,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:19,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 486 transitions. [2022-04-08 10:09:20,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 486 transitions. [2022-04-08 10:09:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:09:20,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:20,885 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:20,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-08 10:09:21,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 10:09:21,086 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1167289689, now seen corresponding path program 7 times [2022-04-08 10:09:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:21,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1541265614] [2022-04-08 10:09:21,088 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:21,088 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1167289689, now seen corresponding path program 8 times [2022-04-08 10:09:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:21,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078109492] [2022-04-08 10:09:21,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:21,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {40546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-08 10:09:21,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-08 10:09:21,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-08 10:09:21,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {40538#true} call ULTIMATE.init(); {40546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:21,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {40546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-08 10:09:21,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-08 10:09:21,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-08 10:09:21,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {40538#true} call #t~ret17 := main(); {40538#true} is VALID [2022-04-08 10:09:21,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {40538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40538#true} is VALID [2022-04-08 10:09:21,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-08 10:09:21,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-08 10:09:21,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {40538#true} assume !(~x~0 % 4294967296 > 0); {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:09:21,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:09:21,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {40539#false} assume !(~x~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {40539#false} assume !(~z~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {40539#false} assume !(~y~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L272 TraceCheckUtils]: 27: Hoare triple {40539#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {40539#false} ~cond := #in~cond; {40539#false} is VALID [2022-04-08 10:09:21,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {40539#false} assume 0 == ~cond; {40539#false} is VALID [2022-04-08 10:09:21,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {40539#false} assume !false; {40539#false} is VALID [2022-04-08 10:09:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:09:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:21,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078109492] [2022-04-08 10:09:21,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078109492] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:21,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453618920] [2022-04-08 10:09:21,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:21,171 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:21,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 10:09:21,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:21,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:21,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:09:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:21,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:21,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {40538#true} call ULTIMATE.init(); {40538#true} is VALID [2022-04-08 10:09:21,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {40538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-08 10:09:21,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-08 10:09:21,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-08 10:09:21,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {40538#true} call #t~ret17 := main(); {40538#true} is VALID [2022-04-08 10:09:21,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {40538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40538#true} is VALID [2022-04-08 10:09:21,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-08 10:09:21,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-08 10:09:21,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {40538#true} assume !(~x~0 % 4294967296 > 0); {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:09:21,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:09:21,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40539#false} is VALID [2022-04-08 10:09:21,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {40539#false} assume !(~x~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-08 10:09:21,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-08 10:09:21,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {40539#false} assume !(~z~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {40539#false} assume !(~y~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,317 INFO L272 TraceCheckUtils]: 27: Hoare triple {40539#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40539#false} is VALID [2022-04-08 10:09:21,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {40539#false} ~cond := #in~cond; {40539#false} is VALID [2022-04-08 10:09:21,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {40539#false} assume 0 == ~cond; {40539#false} is VALID [2022-04-08 10:09:21,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {40539#false} assume !false; {40539#false} is VALID [2022-04-08 10:09:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:09:21,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:21,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {40539#false} assume !false; {40539#false} is VALID [2022-04-08 10:09:21,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {40539#false} assume 0 == ~cond; {40539#false} is VALID [2022-04-08 10:09:21,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {40539#false} ~cond := #in~cond; {40539#false} is VALID [2022-04-08 10:09:21,494 INFO L272 TraceCheckUtils]: 27: Hoare triple {40539#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40539#false} is VALID [2022-04-08 10:09:21,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {40539#false} assume !(~y~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {40539#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {40539#false} is VALID [2022-04-08 10:09:21,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {40539#false} assume !(~z~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-08 10:09:21,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {40539#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {40539#false} is VALID [2022-04-08 10:09:21,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {40539#false} assume !(~x~0 % 4294967296 > 0); {40539#false} is VALID [2022-04-08 10:09:21,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40539#false} is VALID [2022-04-08 10:09:21,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:09:21,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40545#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:09:21,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40544#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:09:21,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {40538#true} assume !(~x~0 % 4294967296 > 0); {40543#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:09:21,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-08 10:09:21,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {40538#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40538#true} is VALID [2022-04-08 10:09:21,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {40538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40538#true} is VALID [2022-04-08 10:09:21,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {40538#true} call #t~ret17 := main(); {40538#true} is VALID [2022-04-08 10:09:21,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40538#true} {40538#true} #94#return; {40538#true} is VALID [2022-04-08 10:09:21,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {40538#true} assume true; {40538#true} is VALID [2022-04-08 10:09:21,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {40538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40538#true} is VALID [2022-04-08 10:09:21,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {40538#true} call ULTIMATE.init(); {40538#true} is VALID [2022-04-08 10:09:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:09:21,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453618920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:21,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:21,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-08 10:09:21,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:21,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1541265614] [2022-04-08 10:09:21,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1541265614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:21,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:21,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:09:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093541234] [2022-04-08 10:09:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:09:21,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:21,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:21,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:21,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:09:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:09:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:09:21,521 INFO L87 Difference]: Start difference. First operand 357 states and 486 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:24,156 INFO L93 Difference]: Finished difference Result 567 states and 770 transitions. [2022-04-08 10:09:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:09:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:09:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-08 10:09:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-08 10:09:24,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-08 10:09:24,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:24,219 INFO L225 Difference]: With dead ends: 567 [2022-04-08 10:09:24,219 INFO L226 Difference]: Without dead ends: 462 [2022-04-08 10:09:24,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:09:24,220 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:24,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 51 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:09:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-08 10:09:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 331. [2022-04-08 10:09:25,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:25,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,524 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,525 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:25,531 INFO L93 Difference]: Finished difference Result 462 states and 624 transitions. [2022-04-08 10:09:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 624 transitions. [2022-04-08 10:09:25,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:25,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:25,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 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 462 states. [2022-04-08 10:09:25,532 INFO L87 Difference]: Start difference. First operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 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 462 states. [2022-04-08 10:09:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:25,539 INFO L93 Difference]: Finished difference Result 462 states and 624 transitions. [2022-04-08 10:09:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 624 transitions. [2022-04-08 10:09:25,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:25,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:25,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:25,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 326 states have (on average 1.352760736196319) internal successors, (441), 326 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 445 transitions. [2022-04-08 10:09:25,545 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 445 transitions. Word has length 31 [2022-04-08 10:09:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:25,545 INFO L478 AbstractCegarLoop]: Abstraction has 331 states and 445 transitions. [2022-04-08 10:09:25,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:25,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 331 states and 445 transitions. [2022-04-08 10:09:26,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 445 transitions. [2022-04-08 10:09:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:09:26,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:26,553 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:26,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-08 10:09:26,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:26,753 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 148988263, now seen corresponding path program 11 times [2022-04-08 10:09:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:26,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649616361] [2022-04-08 10:09:26,756 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:26,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash 148988263, now seen corresponding path program 12 times [2022-04-08 10:09:26,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:26,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921965258] [2022-04-08 10:09:26,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:26,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {43474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-08 10:09:26,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-08 10:09:26,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-08 10:09:26,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {43458#true} call ULTIMATE.init(); {43474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:26,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {43474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-08 10:09:26,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-08 10:09:26,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-08 10:09:26,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {43458#true} call #t~ret17 := main(); {43458#true} is VALID [2022-04-08 10:09:26,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {43458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43463#(= main_~y~0 0)} is VALID [2022-04-08 10:09:26,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {43463#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:26,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {43464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:26,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {43465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:26,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {43466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:26,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {43467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:26,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:26,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {43468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {43469#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:26,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {43469#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43470#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:26,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {43470#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43471#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:26,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {43471#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43472#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:26,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {43472#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43473#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {43473#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {43459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {43459#false} assume !(~x~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:26,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {43459#false} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:26,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:26,933 INFO L272 TraceCheckUtils]: 27: Hoare triple {43459#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43459#false} is VALID [2022-04-08 10:09:26,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {43459#false} ~cond := #in~cond; {43459#false} is VALID [2022-04-08 10:09:26,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {43459#false} assume 0 == ~cond; {43459#false} is VALID [2022-04-08 10:09:26,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {43459#false} assume !false; {43459#false} is VALID [2022-04-08 10:09:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:09:26,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:26,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921965258] [2022-04-08 10:09:26,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921965258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:26,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278238606] [2022-04-08 10:09:26,933 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:26,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:26,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:26,934 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:26,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 10:09:26,974 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:09:26,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:26,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:09:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:26,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:27,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {43458#true} call ULTIMATE.init(); {43458#true} is VALID [2022-04-08 10:09:27,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {43458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-08 10:09:27,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-08 10:09:27,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-08 10:09:27,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {43458#true} call #t~ret17 := main(); {43458#true} is VALID [2022-04-08 10:09:27,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {43458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43458#true} is VALID [2022-04-08 10:09:27,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43458#true} is VALID [2022-04-08 10:09:27,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:27,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:27,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:27,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:27,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:27,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:27,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:27,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:27,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:27,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:27,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {43459#false} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:27,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:27,142 INFO L272 TraceCheckUtils]: 27: Hoare triple {43459#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43459#false} is VALID [2022-04-08 10:09:27,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {43459#false} ~cond := #in~cond; {43459#false} is VALID [2022-04-08 10:09:27,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {43459#false} assume 0 == ~cond; {43459#false} is VALID [2022-04-08 10:09:27,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {43459#false} assume !false; {43459#false} is VALID [2022-04-08 10:09:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:09:27,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:27,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {43459#false} assume !false; {43459#false} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {43459#false} assume 0 == ~cond; {43459#false} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {43459#false} ~cond := #in~cond; {43459#false} is VALID [2022-04-08 10:09:27,244 INFO L272 TraceCheckUtils]: 27: Hoare triple {43459#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43459#false} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {43459#false} assume !(~y~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {43459#false} assume !(~z~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {43459#false} is VALID [2022-04-08 10:09:27,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {43530#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43530#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:27,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:27,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:27,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:27,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:27,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:27,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43511#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:27,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43507#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:27,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43503#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:27,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43499#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:27,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {43458#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43458#true} is VALID [2022-04-08 10:09:27,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {43458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43458#true} is VALID [2022-04-08 10:09:27,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {43458#true} call #t~ret17 := main(); {43458#true} is VALID [2022-04-08 10:09:27,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43458#true} {43458#true} #94#return; {43458#true} is VALID [2022-04-08 10:09:27,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {43458#true} assume true; {43458#true} is VALID [2022-04-08 10:09:27,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {43458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43458#true} is VALID [2022-04-08 10:09:27,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {43458#true} call ULTIMATE.init(); {43458#true} is VALID [2022-04-08 10:09:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:09:27,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278238606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:27,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:27,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-08 10:09:27,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:27,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649616361] [2022-04-08 10:09:27,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649616361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:27,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:27,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:09:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927049041] [2022-04-08 10:09:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:27,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 31 [2022-04-08 10:09:27,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:27,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:09:27,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:27,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:09:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:09:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:09:27,271 INFO L87 Difference]: Start difference. First operand 331 states and 445 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:09:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:29,782 INFO L93 Difference]: Finished difference Result 431 states and 588 transitions. [2022-04-08 10:09:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:09:29,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 31 [2022-04-08 10:09:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:09:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-04-08 10:09:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:09:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-04-08 10:09:29,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 103 transitions. [2022-04-08 10:09:29,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:29,862 INFO L225 Difference]: With dead ends: 431 [2022-04-08 10:09:29,862 INFO L226 Difference]: Without dead ends: 357 [2022-04-08 10:09:29,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:09:29,863 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 66 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:29,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 80 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:09:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-08 10:09:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 332. [2022-04-08 10:09:31,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:31,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:31,181 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:31,181 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:31,186 INFO L93 Difference]: Finished difference Result 357 states and 481 transitions. [2022-04-08 10:09:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 481 transitions. [2022-04-08 10:09:31,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:31,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:31,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 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 357 states. [2022-04-08 10:09:31,186 INFO L87 Difference]: Start difference. First operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 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 357 states. [2022-04-08 10:09:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:31,190 INFO L93 Difference]: Finished difference Result 357 states and 481 transitions. [2022-04-08 10:09:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 481 transitions. [2022-04-08 10:09:31,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:31,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:31,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:31,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.345565749235474) internal successors, (440), 327 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2022-04-08 10:09:31,199 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 444 transitions. Word has length 31 [2022-04-08 10:09:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:31,200 INFO L478 AbstractCegarLoop]: Abstraction has 332 states and 444 transitions. [2022-04-08 10:09:31,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-08 10:09:31,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 332 states and 444 transitions. [2022-04-08 10:09:32,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 444 transitions. [2022-04-08 10:09:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:09:32,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:32,497 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:32,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:32,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:32,699 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 50181113, now seen corresponding path program 27 times [2022-04-08 10:09:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:32,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020769879] [2022-04-08 10:09:32,702 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:32,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 50181113, now seen corresponding path program 28 times [2022-04-08 10:09:32,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:32,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958697310] [2022-04-08 10:09:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:32,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:32,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {45962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-08 10:09:32,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-08 10:09:32,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-08 10:09:32,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {45941#true} call ULTIMATE.init(); {45962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:32,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {45962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-08 10:09:32,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-08 10:09:32,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-08 10:09:32,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {45941#true} call #t~ret17 := main(); {45941#true} is VALID [2022-04-08 10:09:32,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {45941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45946#(= main_~y~0 0)} is VALID [2022-04-08 10:09:32,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {45946#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:32,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {45947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:32,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {45948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:32,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {45949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:32,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {45950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:32,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {45951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:32,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {45952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:32,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {45953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:32,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {45954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:32,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {45955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:32,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {45956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:32,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {45957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:32,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {45958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:32,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {45959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:32,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:32,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {45961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {45961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {45942#false} assume !(~x~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {45942#false} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L272 TraceCheckUtils]: 27: Hoare triple {45942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {45942#false} ~cond := #in~cond; {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {45942#false} assume 0 == ~cond; {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {45942#false} assume !false; {45942#false} is VALID [2022-04-08 10:09:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958697310] [2022-04-08 10:09:32,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958697310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665486245] [2022-04-08 10:09:32,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:32,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:32,964 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:32,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 10:09:32,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:32,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:32,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:09:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:33,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {45941#true} call ULTIMATE.init(); {45941#true} is VALID [2022-04-08 10:09:33,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {45941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-08 10:09:33,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-08 10:09:33,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-08 10:09:33,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {45941#true} call #t~ret17 := main(); {45941#true} is VALID [2022-04-08 10:09:33,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {45941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45946#(= main_~y~0 0)} is VALID [2022-04-08 10:09:33,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {45946#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:33,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {45947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:33,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {45948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:33,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {45949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:33,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {45950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:33,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {45951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:33,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {45952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:33,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {45953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:33,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {45954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:33,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {45955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:33,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {45956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:33,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {45957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:33,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {45958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:33,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {45959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:33,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:33,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {45960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {46029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {46029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {45942#false} assume !(~x~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {45942#false} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L272 TraceCheckUtils]: 27: Hoare triple {45942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {45942#false} ~cond := #in~cond; {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {45942#false} assume 0 == ~cond; {45942#false} is VALID [2022-04-08 10:09:33,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {45942#false} assume !false; {45942#false} is VALID [2022-04-08 10:09:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:33,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:33,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {45942#false} assume !false; {45942#false} is VALID [2022-04-08 10:09:33,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {45942#false} assume 0 == ~cond; {45942#false} is VALID [2022-04-08 10:09:33,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {45942#false} ~cond := #in~cond; {45942#false} is VALID [2022-04-08 10:09:33,674 INFO L272 TraceCheckUtils]: 27: Hoare triple {45942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45942#false} is VALID [2022-04-08 10:09:33,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {45942#false} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {45942#false} assume !(~x~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {45942#false} assume !(~y~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {46081#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45942#false} is VALID [2022-04-08 10:09:33,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {46085#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {46081#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:33,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {46085#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {46085#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:33,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {46092#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46085#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:33,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {46096#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46092#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:33,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {46100#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46096#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:33,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {46104#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46100#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:33,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {46108#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46104#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:33,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {46112#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46108#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:33,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {46116#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46112#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:33,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {46120#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46116#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:33,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {46124#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46120#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:33,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {46128#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46124#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:33,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {46132#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46128#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:33,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {46136#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46132#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:33,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {46140#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46136#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:33,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {46144#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46140#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:33,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {45941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46144#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:33,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {45941#true} call #t~ret17 := main(); {45941#true} is VALID [2022-04-08 10:09:33,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45941#true} {45941#true} #94#return; {45941#true} is VALID [2022-04-08 10:09:33,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {45941#true} assume true; {45941#true} is VALID [2022-04-08 10:09:33,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {45941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45941#true} is VALID [2022-04-08 10:09:33,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {45941#true} call ULTIMATE.init(); {45941#true} is VALID [2022-04-08 10:09:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:33,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665486245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:33,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:33,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:09:33,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:33,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020769879] [2022-04-08 10:09:33,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020769879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:33,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:33,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:09:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586290671] [2022-04-08 10:09:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:09:33,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:33,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:33,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:33,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:09:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:09:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:09:33,704 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:38,953 INFO L93 Difference]: Finished difference Result 479 states and 711 transitions. [2022-04-08 10:09:38,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:09:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:09:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 221 transitions. [2022-04-08 10:09:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 221 transitions. [2022-04-08 10:09:38,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 221 transitions. [2022-04-08 10:09:39,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:39,125 INFO L225 Difference]: With dead ends: 479 [2022-04-08 10:09:39,125 INFO L226 Difference]: Without dead ends: 460 [2022-04-08 10:09:39,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:09:39,126 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 178 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:39,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 172 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 10:09:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-04-08 10:09:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 353. [2022-04-08 10:09:40,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:40,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 460 states. Second operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,507 INFO L74 IsIncluded]: Start isIncluded. First operand 460 states. Second operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,507 INFO L87 Difference]: Start difference. First operand 460 states. Second operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:40,514 INFO L93 Difference]: Finished difference Result 460 states and 609 transitions. [2022-04-08 10:09:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 609 transitions. [2022-04-08 10:09:40,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:40,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:40,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 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 460 states. [2022-04-08 10:09:40,514 INFO L87 Difference]: Start difference. First operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 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 460 states. [2022-04-08 10:09:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:40,521 INFO L93 Difference]: Finished difference Result 460 states and 609 transitions. [2022-04-08 10:09:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 609 transitions. [2022-04-08 10:09:40,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:40,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:40,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:40,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 474 transitions. [2022-04-08 10:09:40,527 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 474 transitions. Word has length 31 [2022-04-08 10:09:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:40,527 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 474 transitions. [2022-04-08 10:09:40,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:40,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 353 states and 474 transitions. [2022-04-08 10:09:41,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 474 transitions. [2022-04-08 10:09:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:09:41,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:41,583 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:41,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:41,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-08 10:09:41,783 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1500175867, now seen corresponding path program 13 times [2022-04-08 10:09:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:41,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040360691] [2022-04-08 10:09:41,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:41,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1500175867, now seen corresponding path program 14 times [2022-04-08 10:09:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:41,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604474301] [2022-04-08 10:09:41,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:41,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {48799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-08 10:09:41,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-08 10:09:41,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-08 10:09:41,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {48781#true} call ULTIMATE.init(); {48799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:41,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {48799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-08 10:09:41,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-08 10:09:41,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-08 10:09:41,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {48781#true} call #t~ret17 := main(); {48781#true} is VALID [2022-04-08 10:09:41,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {48781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48786#(= main_~y~0 0)} is VALID [2022-04-08 10:09:41,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {48786#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:41,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {48787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:41,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {48788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:41,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {48789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:41,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {48790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:41,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:41,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {48791#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {48792#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:41,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {48792#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48793#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {48793#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48794#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:42,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {48794#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48795#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {48795#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48796#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {48796#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48797#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:09:42,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {48797#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48797#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:09:42,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {48797#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48796#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:09:42,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {48796#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48795#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:09:42,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {48795#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48794#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:09:42,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {48794#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48793#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:42,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {48793#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:42,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:42,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:42,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {48798#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {48782#false} assume !(~y~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,005 INFO L272 TraceCheckUtils]: 28: Hoare triple {48782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48782#false} is VALID [2022-04-08 10:09:42,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {48782#false} ~cond := #in~cond; {48782#false} is VALID [2022-04-08 10:09:42,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {48782#false} assume 0 == ~cond; {48782#false} is VALID [2022-04-08 10:09:42,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {48782#false} assume !false; {48782#false} is VALID [2022-04-08 10:09:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:42,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604474301] [2022-04-08 10:09:42,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604474301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:42,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134214630] [2022-04-08 10:09:42,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:42,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:42,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:42,008 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:42,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 10:09:42,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:42,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:42,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:09:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:42,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:42,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {48781#true} call ULTIMATE.init(); {48781#true} is VALID [2022-04-08 10:09:42,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {48781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-08 10:09:42,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-08 10:09:42,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-08 10:09:42,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {48781#true} call #t~ret17 := main(); {48781#true} is VALID [2022-04-08 10:09:42,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {48781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48781#true} is VALID [2022-04-08 10:09:42,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {48781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:42,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:42,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:42,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:42,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:42,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:42,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:42,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:42,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:42,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:42,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:42,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {48782#false} assume !(~z~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {48782#false} assume !(~y~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,236 INFO L272 TraceCheckUtils]: 28: Hoare triple {48782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48782#false} is VALID [2022-04-08 10:09:42,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {48782#false} ~cond := #in~cond; {48782#false} is VALID [2022-04-08 10:09:42,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {48782#false} assume 0 == ~cond; {48782#false} is VALID [2022-04-08 10:09:42,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {48782#false} assume !false; {48782#false} is VALID [2022-04-08 10:09:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:09:42,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:42,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {48782#false} assume !false; {48782#false} is VALID [2022-04-08 10:09:42,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {48782#false} assume 0 == ~cond; {48782#false} is VALID [2022-04-08 10:09:42,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {48782#false} ~cond := #in~cond; {48782#false} is VALID [2022-04-08 10:09:42,328 INFO L272 TraceCheckUtils]: 28: Hoare triple {48782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48782#false} is VALID [2022-04-08 10:09:42,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {48782#false} assume !(~y~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {48782#false} assume !(~z~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {48782#false} is VALID [2022-04-08 10:09:42,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {48859#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48859#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:09:42,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:42,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:42,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:42,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:42,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:42,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:42,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48837#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:09:42,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48833#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:09:42,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48829#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:09:42,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48825#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {48781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48821#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {48781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48781#true} is VALID [2022-04-08 10:09:42,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {48781#true} call #t~ret17 := main(); {48781#true} is VALID [2022-04-08 10:09:42,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48781#true} {48781#true} #94#return; {48781#true} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {48781#true} assume true; {48781#true} is VALID [2022-04-08 10:09:42,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {48781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48781#true} is VALID [2022-04-08 10:09:42,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {48781#true} call ULTIMATE.init(); {48781#true} is VALID [2022-04-08 10:09:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:09:42,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134214630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:42,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:42,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-08 10:09:42,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:42,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040360691] [2022-04-08 10:09:42,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040360691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:42,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:42,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:09:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646366260] [2022-04-08 10:09:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:42,338 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:09:42,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:42,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:42,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:42,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:09:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:42,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:09:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:09:42,359 INFO L87 Difference]: Start difference. First operand 353 states and 474 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:49,046 INFO L93 Difference]: Finished difference Result 635 states and 908 transitions. [2022-04-08 10:09:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-08 10:09:49,047 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:09:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 251 transitions. [2022-04-08 10:09:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 251 transitions. [2022-04-08 10:09:49,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 251 transitions. [2022-04-08 10:09:49,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:49,265 INFO L225 Difference]: With dead ends: 635 [2022-04-08 10:09:49,266 INFO L226 Difference]: Without dead ends: 575 [2022-04-08 10:09:49,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=360, Invalid=4610, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:09:49,267 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 115 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:49,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 99 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:09:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-04-08 10:09:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 391. [2022-04-08 10:09:50,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:50,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 575 states. Second operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:50,886 INFO L74 IsIncluded]: Start isIncluded. First operand 575 states. Second operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:50,886 INFO L87 Difference]: Start difference. First operand 575 states. Second operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:50,895 INFO L93 Difference]: Finished difference Result 575 states and 718 transitions. [2022-04-08 10:09:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 718 transitions. [2022-04-08 10:09:50,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:50,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:50,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 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 575 states. [2022-04-08 10:09:50,896 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 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 575 states. [2022-04-08 10:09:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:50,906 INFO L93 Difference]: Finished difference Result 575 states and 718 transitions. [2022-04-08 10:09:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 718 transitions. [2022-04-08 10:09:50,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:50,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:50,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:50,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.354922279792746) internal successors, (523), 386 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 527 transitions. [2022-04-08 10:09:50,913 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 527 transitions. Word has length 32 [2022-04-08 10:09:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:50,913 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 527 transitions. [2022-04-08 10:09:50,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:50,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 527 transitions. [2022-04-08 10:09:52,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2022-04-08 10:09:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:09:52,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:52,094 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:52,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:52,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:52,295 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:52,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -994144843, now seen corresponding path program 7 times [2022-04-08 10:09:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:52,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375934743] [2022-04-08 10:09:52,297 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:52,297 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash -994144843, now seen corresponding path program 8 times [2022-04-08 10:09:52,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:52,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185742788] [2022-04-08 10:09:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:52,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {52311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-08 10:09:52,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-08 10:09:52,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-08 10:09:52,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {52297#true} call ULTIMATE.init(); {52311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:52,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {52311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-08 10:09:52,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-08 10:09:52,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-08 10:09:52,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {52297#true} call #t~ret17 := main(); {52297#true} is VALID [2022-04-08 10:09:52,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {52297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52302#(= main_~y~0 0)} is VALID [2022-04-08 10:09:52,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {52302#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:52,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {52303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:52,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {52304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:52,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {52305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:52,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {52306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:52,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {52307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:52,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:52,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {52309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:52,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {52309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52310#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:52,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {52310#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {52298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {52298#false} assume !(~x~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {52298#false} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L272 TraceCheckUtils]: 28: Hoare triple {52298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52298#false} is VALID [2022-04-08 10:09:52,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {52298#false} ~cond := #in~cond; {52298#false} is VALID [2022-04-08 10:09:52,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {52298#false} assume 0 == ~cond; {52298#false} is VALID [2022-04-08 10:09:52,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {52298#false} assume !false; {52298#false} is VALID [2022-04-08 10:09:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 10:09:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:52,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185742788] [2022-04-08 10:09:52,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185742788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:52,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863082052] [2022-04-08 10:09:52,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:52,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:52,422 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:52,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 10:09:52,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:52,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:52,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:09:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:52,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:52,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {52297#true} call ULTIMATE.init(); {52297#true} is VALID [2022-04-08 10:09:52,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {52297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-08 10:09:52,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-08 10:09:52,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-08 10:09:52,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {52297#true} call #t~ret17 := main(); {52297#true} is VALID [2022-04-08 10:09:52,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {52297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52302#(= main_~y~0 0)} is VALID [2022-04-08 10:09:52,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {52302#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:52,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {52303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:52,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {52304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:52,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {52305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:52,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {52306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:52,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {52307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:52,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:52,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {52308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {52309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:52,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {52309#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {52357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {52298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {52298#false} assume !(~x~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {52298#false} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {52298#false} is VALID [2022-04-08 10:09:52,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,671 INFO L272 TraceCheckUtils]: 28: Hoare triple {52298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52298#false} is VALID [2022-04-08 10:09:52,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {52298#false} ~cond := #in~cond; {52298#false} is VALID [2022-04-08 10:09:52,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {52298#false} assume 0 == ~cond; {52298#false} is VALID [2022-04-08 10:09:52,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {52298#false} assume !false; {52298#false} is VALID [2022-04-08 10:09:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 10:09:52,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:52,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {52298#false} assume !false; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {52298#false} assume 0 == ~cond; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {52298#false} ~cond := #in~cond; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L272 TraceCheckUtils]: 28: Hoare triple {52298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {52298#false} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {52298#false} assume !(~x~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {52298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {52298#false} assume !(~y~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {52298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52298#false} is VALID [2022-04-08 10:09:52,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {52457#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {52298#false} is VALID [2022-04-08 10:09:52,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {52461#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52457#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:52,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {52461#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:52,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:52,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {52472#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52465#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:52,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {52476#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52472#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:52,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {52480#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52476#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:52,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {52484#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52480#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:52,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {52488#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52484#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:52,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {52492#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52488#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:52,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {52297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52492#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:52,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {52297#true} call #t~ret17 := main(); {52297#true} is VALID [2022-04-08 10:09:52,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52297#true} {52297#true} #94#return; {52297#true} is VALID [2022-04-08 10:09:52,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {52297#true} assume true; {52297#true} is VALID [2022-04-08 10:09:52,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {52297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52297#true} is VALID [2022-04-08 10:09:52,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {52297#true} call ULTIMATE.init(); {52297#true} is VALID [2022-04-08 10:09:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 10:09:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863082052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:52,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:52,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:09:52,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:52,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375934743] [2022-04-08 10:09:52,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375934743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:52,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:52,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:09:52,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687706291] [2022-04-08 10:09:52,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:52,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 32 [2022-04-08 10:09:52,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:52,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-08 10:09:52,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-08 10:09:52,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:09:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:09:52,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:09:52,885 INFO L87 Difference]: Start difference. First operand 391 states and 527 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-08 10:09:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:55,618 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2022-04-08 10:09:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:09:55,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 32 [2022-04-08 10:09:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-08 10:09:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 105 transitions. [2022-04-08 10:09:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-08 10:09:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 105 transitions. [2022-04-08 10:09:55,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 105 transitions. [2022-04-08 10:09:55,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:55,702 INFO L225 Difference]: With dead ends: 457 [2022-04-08 10:09:55,703 INFO L226 Difference]: Without dead ends: 440 [2022-04-08 10:09:55,703 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:09:55,703 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:55,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:09:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-08 10:09:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 391. [2022-04-08 10:09:57,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:57,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:57,314 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:57,314 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:57,320 INFO L93 Difference]: Finished difference Result 440 states and 589 transitions. [2022-04-08 10:09:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2022-04-08 10:09:57,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:57,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:57,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 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 440 states. [2022-04-08 10:09:57,321 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 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 440 states. [2022-04-08 10:09:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:57,327 INFO L93 Difference]: Finished difference Result 440 states and 589 transitions. [2022-04-08 10:09:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2022-04-08 10:09:57,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:57,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:57,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:57,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.3523316062176165) internal successors, (522), 386 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:09:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 526 transitions. [2022-04-08 10:09:57,334 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 526 transitions. Word has length 32 [2022-04-08 10:09:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:57,335 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 526 transitions. [2022-04-08 10:09:57,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-08 10:09:57,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 526 transitions. [2022-04-08 10:09:58,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 526 transitions. [2022-04-08 10:09:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:09:58,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:58,667 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:58,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:58,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:58,868 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash 286976406, now seen corresponding path program 29 times [2022-04-08 10:09:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:58,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1370278059] [2022-04-08 10:09:58,870 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:58,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash 286976406, now seen corresponding path program 30 times [2022-04-08 10:09:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:58,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070501783] [2022-04-08 10:09:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:59,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {55131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-08 10:09:59,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-08 10:09:59,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-08 10:09:59,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {55109#true} call ULTIMATE.init(); {55131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:59,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {55131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-08 10:09:59,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-08 10:09:59,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-08 10:09:59,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {55109#true} call #t~ret17 := main(); {55109#true} is VALID [2022-04-08 10:09:59,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {55109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55114#(= main_~y~0 0)} is VALID [2022-04-08 10:09:59,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {55114#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55115#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:59,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {55115#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55116#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:59,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {55116#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55117#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:59,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {55117#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55118#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:59,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {55118#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55119#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:59,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {55119#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55120#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:59,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {55120#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55121#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:59,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {55121#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55122#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:59,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {55122#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55123#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:59,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {55123#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55124#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:59,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {55124#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55125#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:59,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {55125#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55126#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:59,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {55126#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55127#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:59,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {55127#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55128#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:59,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {55128#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:59,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:59,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {55130#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:59,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {55130#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {55110#false} assume !(~x~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {55110#false} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L272 TraceCheckUtils]: 28: Hoare triple {55110#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {55110#false} ~cond := #in~cond; {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {55110#false} assume 0 == ~cond; {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {55110#false} assume !false; {55110#false} is VALID [2022-04-08 10:09:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:59,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070501783] [2022-04-08 10:09:59,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070501783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020594594] [2022-04-08 10:09:59,130 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:59,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:59,130 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:59,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 10:09:59,268 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:09:59,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:59,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:09:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:59,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:59,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {55109#true} call ULTIMATE.init(); {55109#true} is VALID [2022-04-08 10:09:59,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {55109#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-08 10:09:59,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-08 10:09:59,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-08 10:09:59,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {55109#true} call #t~ret17 := main(); {55109#true} is VALID [2022-04-08 10:09:59,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {55109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55114#(= main_~y~0 0)} is VALID [2022-04-08 10:09:59,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {55114#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55115#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:59,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {55115#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55116#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:59,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {55116#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55117#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:59,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {55117#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55118#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:59,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {55118#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55119#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:59,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {55119#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55120#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:59,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {55120#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55121#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:59,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {55121#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55122#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:59,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {55122#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55123#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:59,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {55123#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55124#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:59,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {55124#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55125#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:59,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {55125#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55126#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:59,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {55126#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55127#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:59,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {55127#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55128#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:59,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {55128#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:59,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:59,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {55129#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {55201#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {55201#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {55110#false} assume !(~x~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {55110#false} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L272 TraceCheckUtils]: 28: Hoare triple {55110#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {55110#false} ~cond := #in~cond; {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {55110#false} assume 0 == ~cond; {55110#false} is VALID [2022-04-08 10:09:59,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {55110#false} assume !false; {55110#false} is VALID [2022-04-08 10:09:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:59,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:00,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {55110#false} assume !false; {55110#false} is VALID [2022-04-08 10:10:00,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {55110#false} assume 0 == ~cond; {55110#false} is VALID [2022-04-08 10:10:00,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {55110#false} ~cond := #in~cond; {55110#false} is VALID [2022-04-08 10:10:00,047 INFO L272 TraceCheckUtils]: 28: Hoare triple {55110#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55110#false} is VALID [2022-04-08 10:10:00,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:10:00,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {55110#false} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:10:00,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {55110#false} assume !(~x~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:10:00,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {55110#false} assume !(~y~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:10:00,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {55253#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {55110#false} is VALID [2022-04-08 10:10:00,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {55257#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {55253#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:00,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {55257#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {55257#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:00,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {55264#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55257#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:00,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {55268#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55264#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:00,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {55272#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55268#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:00,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {55276#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55272#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:00,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {55280#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55276#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:00,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {55284#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55280#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:00,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {55288#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55284#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:00,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {55292#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55288#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:00,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {55296#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55292#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:00,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {55300#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55296#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:00,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {55304#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55300#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:00,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {55308#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55304#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:00,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {55312#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55308#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:00,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {55316#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55312#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:00,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {55320#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55316#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:00,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {55109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55320#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:00,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {55109#true} call #t~ret17 := main(); {55109#true} is VALID [2022-04-08 10:10:00,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55109#true} {55109#true} #94#return; {55109#true} is VALID [2022-04-08 10:10:00,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {55109#true} assume true; {55109#true} is VALID [2022-04-08 10:10:00,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {55109#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55109#true} is VALID [2022-04-08 10:10:00,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {55109#true} call ULTIMATE.init(); {55109#true} is VALID [2022-04-08 10:10:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:00,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020594594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:00,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:00,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:10:00,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:00,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1370278059] [2022-04-08 10:10:00,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1370278059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:00,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:00,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:10:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220413866] [2022-04-08 10:10:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:10:00,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:00,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:00,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:00,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:10:00,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:10:00,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:10:00,082 INFO L87 Difference]: Start difference. First operand 391 states and 526 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:06,179 INFO L93 Difference]: Finished difference Result 547 states and 810 transitions. [2022-04-08 10:10:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:10:06,180 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 10:10:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 234 transitions. [2022-04-08 10:10:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 234 transitions. [2022-04-08 10:10:06,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 234 transitions. [2022-04-08 10:10:06,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:06,365 INFO L225 Difference]: With dead ends: 547 [2022-04-08 10:10:06,365 INFO L226 Difference]: Without dead ends: 528 [2022-04-08 10:10:06,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:10:06,366 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 193 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:06,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 183 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 10:10:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-04-08 10:10:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 414. [2022-04-08 10:10:08,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:08,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 528 states. Second operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,092 INFO L74 IsIncluded]: Start isIncluded. First operand 528 states. Second operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,092 INFO L87 Difference]: Start difference. First operand 528 states. Second operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:08,100 INFO L93 Difference]: Finished difference Result 528 states and 703 transitions. [2022-04-08 10:10:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 703 transitions. [2022-04-08 10:10:08,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:08,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:08,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 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 528 states. [2022-04-08 10:10:08,101 INFO L87 Difference]: Start difference. First operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 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 528 states. [2022-04-08 10:10:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:08,109 INFO L93 Difference]: Finished difference Result 528 states and 703 transitions. [2022-04-08 10:10:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 703 transitions. [2022-04-08 10:10:08,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:08,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:08,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:08,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 409 states have (on average 1.3569682151589242) internal successors, (555), 409 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 559 transitions. [2022-04-08 10:10:08,117 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 559 transitions. Word has length 32 [2022-04-08 10:10:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:08,117 INFO L478 AbstractCegarLoop]: Abstraction has 414 states and 559 transitions. [2022-04-08 10:10:08,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:08,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 414 states and 559 transitions. [2022-04-08 10:10:09,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 559 transitions. [2022-04-08 10:10:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:10:09,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:09,394 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:09,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:09,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 10:10:09,595 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2109757017, now seen corresponding path program 7 times [2022-04-08 10:10:09,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:09,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720133571] [2022-04-08 10:10:09,598 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:09,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2109757017, now seen corresponding path program 8 times [2022-04-08 10:10:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:09,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966011647] [2022-04-08 10:10:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:09,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {58366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-08 10:10:09,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-08 10:10:09,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-08 10:10:09,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {58353#true} call ULTIMATE.init(); {58366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:09,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {58366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-08 10:10:09,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-08 10:10:09,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-08 10:10:09,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {58353#true} call #t~ret17 := main(); {58353#true} is VALID [2022-04-08 10:10:09,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {58353#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58353#true} is VALID [2022-04-08 10:10:09,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {58353#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:09,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58359#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:10:09,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {58359#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58360#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:09,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {58360#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:09,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:09,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:09,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {58361#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58362#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:10:09,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {58362#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58363#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:10:09,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {58363#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58364#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:10:09,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {58364#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:09,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:09,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:09,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:09,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:09,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:09,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {58365#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {58354#false} assume !(~z~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {58354#false} assume !(~y~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L272 TraceCheckUtils]: 29: Hoare triple {58354#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58354#false} is VALID [2022-04-08 10:10:09,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {58354#false} ~cond := #in~cond; {58354#false} is VALID [2022-04-08 10:10:09,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {58354#false} assume 0 == ~cond; {58354#false} is VALID [2022-04-08 10:10:09,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {58354#false} assume !false; {58354#false} is VALID [2022-04-08 10:10:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:10:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:09,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966011647] [2022-04-08 10:10:09,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966011647] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:09,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399493907] [2022-04-08 10:10:09,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:09,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:09,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:09,753 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:09,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 10:10:09,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:09,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:09,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:10:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:09,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:09,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {58353#true} call ULTIMATE.init(); {58353#true} is VALID [2022-04-08 10:10:09,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {58353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-08 10:10:09,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-08 10:10:09,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-08 10:10:09,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {58353#true} call #t~ret17 := main(); {58353#true} is VALID [2022-04-08 10:10:09,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {58353#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58353#true} is VALID [2022-04-08 10:10:09,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {58353#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:09,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:09,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:09,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:09,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:09,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:09,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:09,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:09,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:09,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:09,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {58354#false} assume !(~z~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:09,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {58354#false} assume !(~y~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:09,937 INFO L272 TraceCheckUtils]: 29: Hoare triple {58354#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58354#false} is VALID [2022-04-08 10:10:09,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {58354#false} ~cond := #in~cond; {58354#false} is VALID [2022-04-08 10:10:09,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {58354#false} assume 0 == ~cond; {58354#false} is VALID [2022-04-08 10:10:09,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {58354#false} assume !false; {58354#false} is VALID [2022-04-08 10:10:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:10:09,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {58354#false} assume !false; {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {58354#false} assume 0 == ~cond; {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {58354#false} ~cond := #in~cond; {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L272 TraceCheckUtils]: 29: Hoare triple {58354#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {58354#false} assume !(~y~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {58354#false} assume !(~z~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:10,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {58354#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58354#false} is VALID [2022-04-08 10:10:10,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {58354#false} is VALID [2022-04-08 10:10:10,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58418#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:10,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:10,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:10,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:10,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58399#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:10,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58395#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:10,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58391#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:10,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {58353#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58358#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:10,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {58353#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58353#true} is VALID [2022-04-08 10:10:10,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {58353#true} call #t~ret17 := main(); {58353#true} is VALID [2022-04-08 10:10:10,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58353#true} {58353#true} #94#return; {58353#true} is VALID [2022-04-08 10:10:10,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {58353#true} assume true; {58353#true} is VALID [2022-04-08 10:10:10,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {58353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58353#true} is VALID [2022-04-08 10:10:10,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {58353#true} call ULTIMATE.init(); {58353#true} is VALID [2022-04-08 10:10:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:10:10,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399493907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:10,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:10,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-08 10:10:10,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:10,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720133571] [2022-04-08 10:10:10,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720133571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:10,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:10,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:10:10,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090565981] [2022-04-08 10:10:10,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:10,062 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 33 [2022-04-08 10:10:10,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:10,063 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-08 10:10:10,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:10,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:10:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:10,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:10:10,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:10:10,082 INFO L87 Difference]: Start difference. First operand 414 states and 559 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-08 10:10:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:15,427 INFO L93 Difference]: Finished difference Result 786 states and 1051 transitions. [2022-04-08 10:10:15,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:10:15,427 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 33 [2022-04-08 10:10:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:15,428 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-08 10:10:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-08 10:10:15,428 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-08 10:10:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-08 10:10:15,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 97 transitions. [2022-04-08 10:10:15,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:15,536 INFO L225 Difference]: With dead ends: 786 [2022-04-08 10:10:15,536 INFO L226 Difference]: Without dead ends: 751 [2022-04-08 10:10:15,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:10:15,537 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 107 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:15,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 63 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:10:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-04-08 10:10:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 447. [2022-04-08 10:10:17,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:17,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:17,576 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:17,577 INFO L87 Difference]: Start difference. First operand 751 states. Second operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:17,591 INFO L93 Difference]: Finished difference Result 751 states and 999 transitions. [2022-04-08 10:10:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 999 transitions. [2022-04-08 10:10:17,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:17,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:17,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 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 751 states. [2022-04-08 10:10:17,592 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 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 751 states. [2022-04-08 10:10:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:17,606 INFO L93 Difference]: Finished difference Result 751 states and 999 transitions. [2022-04-08 10:10:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 999 transitions. [2022-04-08 10:10:17,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:17,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:17,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:17,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 442 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 600 transitions. [2022-04-08 10:10:17,615 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 600 transitions. Word has length 33 [2022-04-08 10:10:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:17,615 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 600 transitions. [2022-04-08 10:10:17,615 INFO L479 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-08 10:10:17,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 600 transitions. [2022-04-08 10:10:19,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 600 transitions. [2022-04-08 10:10:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:10:19,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:19,411 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:19,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:19,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 10:10:19,611 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -962304103, now seen corresponding path program 31 times [2022-04-08 10:10:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:19,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092508631] [2022-04-08 10:10:19,614 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:19,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash -962304103, now seen corresponding path program 32 times [2022-04-08 10:10:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:19,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801807590] [2022-04-08 10:10:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:19,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:19,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:19,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {62575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-08 10:10:19,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-08 10:10:19,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-08 10:10:19,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {62552#true} call ULTIMATE.init(); {62575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:19,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {62575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-08 10:10:19,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-08 10:10:19,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-08 10:10:19,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {62552#true} call #t~ret17 := main(); {62552#true} is VALID [2022-04-08 10:10:19,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {62552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62557#(= main_~y~0 0)} is VALID [2022-04-08 10:10:19,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {62557#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:19,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {62558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:19,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {62559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:19,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {62560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:19,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {62561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:19,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {62562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:19,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {62563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:19,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {62564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:19,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {62565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:19,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {62566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62567#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:19,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {62567#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62568#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:19,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {62568#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62569#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:19,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {62569#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62570#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:19,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {62570#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62571#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:19,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {62571#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62572#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:19,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {62572#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:19,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:19,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {62574#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:19,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {62574#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:19,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:19,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {62553#false} assume !(~x~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:19,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {62553#false} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:19,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:19,952 INFO L272 TraceCheckUtils]: 29: Hoare triple {62553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62553#false} is VALID [2022-04-08 10:10:19,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {62553#false} ~cond := #in~cond; {62553#false} is VALID [2022-04-08 10:10:19,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {62553#false} assume 0 == ~cond; {62553#false} is VALID [2022-04-08 10:10:19,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {62553#false} assume !false; {62553#false} is VALID [2022-04-08 10:10:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:19,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801807590] [2022-04-08 10:10:19,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801807590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:19,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086145795] [2022-04-08 10:10:19,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:19,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:19,954 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:19,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 10:10:19,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:19,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:19,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:10:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:19,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:20,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {62552#true} call ULTIMATE.init(); {62552#true} is VALID [2022-04-08 10:10:20,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {62552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-08 10:10:20,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-08 10:10:20,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-08 10:10:20,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {62552#true} call #t~ret17 := main(); {62552#true} is VALID [2022-04-08 10:10:20,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {62552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62557#(= main_~y~0 0)} is VALID [2022-04-08 10:10:20,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {62557#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:20,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {62558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:20,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {62559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:20,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {62560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:20,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {62561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:20,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {62562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:20,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {62563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:20,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {62564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:20,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {62565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:20,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {62566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62567#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:20,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {62567#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62568#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:20,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {62568#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62569#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:20,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {62569#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62570#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:20,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {62570#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62571#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:20,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {62571#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62572#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:20,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {62572#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:20,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {62573#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {62648#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {62648#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {62553#false} assume !(~x~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {62553#false} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,298 INFO L272 TraceCheckUtils]: 29: Hoare triple {62553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62553#false} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {62553#false} ~cond := #in~cond; {62553#false} is VALID [2022-04-08 10:10:20,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {62553#false} assume 0 == ~cond; {62553#false} is VALID [2022-04-08 10:10:20,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {62553#false} assume !false; {62553#false} is VALID [2022-04-08 10:10:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:20,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:20,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {62553#false} assume !false; {62553#false} is VALID [2022-04-08 10:10:20,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {62553#false} assume 0 == ~cond; {62553#false} is VALID [2022-04-08 10:10:20,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {62553#false} ~cond := #in~cond; {62553#false} is VALID [2022-04-08 10:10:20,824 INFO L272 TraceCheckUtils]: 29: Hoare triple {62553#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62553#false} is VALID [2022-04-08 10:10:20,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {62553#false} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {62553#false} assume !(~x~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {62553#false} assume !(~y~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {62700#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62553#false} is VALID [2022-04-08 10:10:20,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {62704#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {62700#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:20,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {62704#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {62704#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:20,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {62711#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62704#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:20,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {62715#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62711#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:20,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {62719#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62715#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:20,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {62723#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62719#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:20,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {62727#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62723#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:20,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {62731#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62727#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:20,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {62735#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62731#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:20,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {62739#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62735#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:20,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {62743#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62739#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:20,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {62747#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62743#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:20,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {62751#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62747#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:20,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {62755#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62751#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:20,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {62759#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62755#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:20,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {62763#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62759#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:20,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {62767#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62763#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:20,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {62771#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62767#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:20,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {62552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62771#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:10:20,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {62552#true} call #t~ret17 := main(); {62552#true} is VALID [2022-04-08 10:10:20,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62552#true} {62552#true} #94#return; {62552#true} is VALID [2022-04-08 10:10:20,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {62552#true} assume true; {62552#true} is VALID [2022-04-08 10:10:20,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {62552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62552#true} is VALID [2022-04-08 10:10:20,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {62552#true} call ULTIMATE.init(); {62552#true} is VALID [2022-04-08 10:10:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:20,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086145795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:20,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:20,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:10:20,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:20,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092508631] [2022-04-08 10:10:20,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092508631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:20,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:20,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:10:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629866437] [2022-04-08 10:10:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:10:20,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:20,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:20,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:20,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:10:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:20,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:10:20,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:10:20,855 INFO L87 Difference]: Start difference. First operand 447 states and 600 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:28,046 INFO L93 Difference]: Finished difference Result 634 states and 941 transitions. [2022-04-08 10:10:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:10:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:10:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 247 transitions. [2022-04-08 10:10:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 247 transitions. [2022-04-08 10:10:28,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 247 transitions. [2022-04-08 10:10:28,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:28,243 INFO L225 Difference]: With dead ends: 634 [2022-04-08 10:10:28,243 INFO L226 Difference]: Without dead ends: 613 [2022-04-08 10:10:28,244 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:10:28,244 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 207 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:28,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 194 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:10:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-04-08 10:10:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 472. [2022-04-08 10:10:30,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:30,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:30,415 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:30,416 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:30,426 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-08 10:10:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-08 10:10:30,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:30,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:30,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 states have internal predecessors, (632), 3 states have call successors, (3), 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 613 states. [2022-04-08 10:10:30,427 INFO L87 Difference]: Start difference. First operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 states have internal predecessors, (632), 3 states have call successors, (3), 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 613 states. [2022-04-08 10:10:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:30,437 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-08 10:10:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-08 10:10:30,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:30,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:30,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:30,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 467 states have (on average 1.3533190578158458) internal successors, (632), 467 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 636 transitions. [2022-04-08 10:10:30,446 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 636 transitions. Word has length 33 [2022-04-08 10:10:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:30,446 INFO L478 AbstractCegarLoop]: Abstraction has 472 states and 636 transitions. [2022-04-08 10:10:30,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:30,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 472 states and 636 transitions. [2022-04-08 10:10:32,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 636 transitions. [2022-04-08 10:10:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:32,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:32,228 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:32,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:32,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-08 10:10:32,428 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2139889685, now seen corresponding path program 15 times [2022-04-08 10:10:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:32,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142880189] [2022-04-08 10:10:32,431 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:32,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2139889685, now seen corresponding path program 16 times [2022-04-08 10:10:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:32,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647074078] [2022-04-08 10:10:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:32,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {66284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-08 10:10:32,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-08 10:10:32,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-08 10:10:32,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {66266#true} call ULTIMATE.init(); {66284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:32,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {66284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-08 10:10:32,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-08 10:10:32,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-08 10:10:32,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {66266#true} call #t~ret17 := main(); {66266#true} is VALID [2022-04-08 10:10:32,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {66266#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66271#(= main_~y~0 0)} is VALID [2022-04-08 10:10:32,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {66271#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66272#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:32,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {66272#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66273#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:32,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {66273#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66274#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:32,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {66274#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66275#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:32,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {66275#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66276#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:32,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {66276#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:32,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:32,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {66277#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {66278#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:32,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {66278#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66279#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:32,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {66279#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66280#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:32,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {66280#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66281#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:32,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {66281#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66282#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:32,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {66282#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66283#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {66283#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {66267#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {66267#false} assume !(~x~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {66267#false} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,614 INFO L272 TraceCheckUtils]: 30: Hoare triple {66267#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66267#false} is VALID [2022-04-08 10:10:32,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {66267#false} ~cond := #in~cond; {66267#false} is VALID [2022-04-08 10:10:32,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {66267#false} assume 0 == ~cond; {66267#false} is VALID [2022-04-08 10:10:32,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {66267#false} assume !false; {66267#false} is VALID [2022-04-08 10:10:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:10:32,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647074078] [2022-04-08 10:10:32,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647074078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847499984] [2022-04-08 10:10:32,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:32,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:32,615 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:32,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 10:10:32,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:32,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:32,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:10:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:32,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:32,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {66266#true} call ULTIMATE.init(); {66266#true} is VALID [2022-04-08 10:10:32,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {66266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-08 10:10:32,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-08 10:10:32,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-08 10:10:32,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {66266#true} call #t~ret17 := main(); {66266#true} is VALID [2022-04-08 10:10:32,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {66266#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66266#true} is VALID [2022-04-08 10:10:32,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66266#true} is VALID [2022-04-08 10:10:32,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:32,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:32,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:32,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:32,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:32,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:32,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:32,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:32,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:32,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:32,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:32,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {66267#false} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,859 INFO L272 TraceCheckUtils]: 30: Hoare triple {66267#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66267#false} is VALID [2022-04-08 10:10:32,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {66267#false} ~cond := #in~cond; {66267#false} is VALID [2022-04-08 10:10:32,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {66267#false} assume 0 == ~cond; {66267#false} is VALID [2022-04-08 10:10:32,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {66267#false} assume !false; {66267#false} is VALID [2022-04-08 10:10:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:10:32,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:32,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {66267#false} assume !false; {66267#false} is VALID [2022-04-08 10:10:32,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {66267#false} assume 0 == ~cond; {66267#false} is VALID [2022-04-08 10:10:32,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {66267#false} ~cond := #in~cond; {66267#false} is VALID [2022-04-08 10:10:32,955 INFO L272 TraceCheckUtils]: 30: Hoare triple {66267#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66267#false} is VALID [2022-04-08 10:10:32,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {66267#false} assume !(~y~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {66267#false} assume !(~z~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {66267#false} is VALID [2022-04-08 10:10:32,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {66347#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:32,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:32,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:32,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:32,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:32,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:32,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:32,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66325#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:10:32,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66321#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:10:32,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66317#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:10:32,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66313#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:10:32,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66309#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:10:32,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {66266#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66266#true} is VALID [2022-04-08 10:10:32,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {66266#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66266#true} is VALID [2022-04-08 10:10:32,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {66266#true} call #t~ret17 := main(); {66266#true} is VALID [2022-04-08 10:10:32,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66266#true} {66266#true} #94#return; {66266#true} is VALID [2022-04-08 10:10:32,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {66266#true} assume true; {66266#true} is VALID [2022-04-08 10:10:32,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {66266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66266#true} is VALID [2022-04-08 10:10:32,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {66266#true} call ULTIMATE.init(); {66266#true} is VALID [2022-04-08 10:10:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:10:32,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847499984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:32,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:32,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-08 10:10:32,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:32,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142880189] [2022-04-08 10:10:32,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142880189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:32,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:32,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:10:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783412332] [2022-04-08 10:10:32,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:10:32,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:32,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:32,983 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-08 10:10:32,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:10:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:32,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:10:32,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:10:32,983 INFO L87 Difference]: Start difference. First operand 472 states and 636 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:37,115 INFO L93 Difference]: Finished difference Result 599 states and 814 transitions. [2022-04-08 10:10:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:10:37,115 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:10:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-08 10:10:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-08 10:10:37,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-08 10:10:37,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:37,212 INFO L225 Difference]: With dead ends: 599 [2022-04-08 10:10:37,212 INFO L226 Difference]: Without dead ends: 502 [2022-04-08 10:10:37,212 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1952, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:10:37,214 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:37,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 103 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:10:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-08 10:10:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 473. [2022-04-08 10:10:39,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:39,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 502 states. Second operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:39,362 INFO L74 IsIncluded]: Start isIncluded. First operand 502 states. Second operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:39,362 INFO L87 Difference]: Start difference. First operand 502 states. Second operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:39,369 INFO L93 Difference]: Finished difference Result 502 states and 677 transitions. [2022-04-08 10:10:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 677 transitions. [2022-04-08 10:10:39,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:39,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:39,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 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 502 states. [2022-04-08 10:10:39,370 INFO L87 Difference]: Start difference. First operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 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 502 states. [2022-04-08 10:10:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:39,378 INFO L93 Difference]: Finished difference Result 502 states and 677 transitions. [2022-04-08 10:10:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 677 transitions. [2022-04-08 10:10:39,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:39,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:39,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:39,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 468 states have (on average 1.3461538461538463) internal successors, (630), 468 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 634 transitions. [2022-04-08 10:10:39,392 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 634 transitions. Word has length 34 [2022-04-08 10:10:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:39,392 INFO L478 AbstractCegarLoop]: Abstraction has 473 states and 634 transitions. [2022-04-08 10:10:39,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:39,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 473 states and 634 transitions. [2022-04-08 10:10:41,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 634 transitions. [2022-04-08 10:10:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:41,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:41,480 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:41,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:41,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:41,680 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1795073307, now seen corresponding path program 9 times [2022-04-08 10:10:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:41,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4060212] [2022-04-08 10:10:41,684 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:41,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1795073307, now seen corresponding path program 10 times [2022-04-08 10:10:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:41,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234473971] [2022-04-08 10:10:41,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:41,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:41,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {69707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-08 10:10:41,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-08 10:10:41,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-08 10:10:41,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {69692#true} call ULTIMATE.init(); {69707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:41,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {69707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-08 10:10:41,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-08 10:10:41,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-08 10:10:41,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {69692#true} call #t~ret17 := main(); {69692#true} is VALID [2022-04-08 10:10:41,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {69692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69697#(= main_~y~0 0)} is VALID [2022-04-08 10:10:41,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {69697#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:41,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {69698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:41,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {69699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:41,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {69700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:41,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {69701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:41,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {69702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:41,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {69703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:41,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:41,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {69705#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:41,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {69705#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69706#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {69706#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {69693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69693#false} is VALID [2022-04-08 10:10:41,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {69693#false} assume !(~x~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {69693#false} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L272 TraceCheckUtils]: 30: Hoare triple {69693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {69693#false} ~cond := #in~cond; {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {69693#false} assume 0 == ~cond; {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {69693#false} assume !false; {69693#false} is VALID [2022-04-08 10:10:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:41,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234473971] [2022-04-08 10:10:41,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234473971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:41,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163394905] [2022-04-08 10:10:41,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:41,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:41,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:41,847 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:41,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 10:10:41,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:41,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:41,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:10:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:41,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:42,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {69692#true} call ULTIMATE.init(); {69692#true} is VALID [2022-04-08 10:10:42,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {69692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-08 10:10:42,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-08 10:10:42,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-08 10:10:42,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {69692#true} call #t~ret17 := main(); {69692#true} is VALID [2022-04-08 10:10:42,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {69692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69697#(= main_~y~0 0)} is VALID [2022-04-08 10:10:42,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {69697#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:42,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {69698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:42,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {69699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:42,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {69700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:42,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {69701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:42,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {69702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:42,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {69703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:42,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:42,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {69704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {69705#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:42,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {69705#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69756#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {69756#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {69693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69693#false} is VALID [2022-04-08 10:10:42,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {69693#false} assume !(~x~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {69693#false} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L272 TraceCheckUtils]: 30: Hoare triple {69693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {69693#false} ~cond := #in~cond; {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {69693#false} assume 0 == ~cond; {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {69693#false} assume !false; {69693#false} is VALID [2022-04-08 10:10:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:42,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:42,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {69693#false} assume !false; {69693#false} is VALID [2022-04-08 10:10:42,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {69693#false} assume 0 == ~cond; {69693#false} is VALID [2022-04-08 10:10:42,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {69693#false} ~cond := #in~cond; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L272 TraceCheckUtils]: 30: Hoare triple {69693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {69693#false} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {69693#false} assume !(~x~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {69693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {69693#false} assume !(~y~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {69693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69693#false} is VALID [2022-04-08 10:10:42,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {69862#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69693#false} is VALID [2022-04-08 10:10:42,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {69866#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69862#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:42,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {69866#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:42,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:42,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {69877#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:42,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {69881#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69877#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:42,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {69885#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69881#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:42,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {69889#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69885#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:42,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {69893#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69889#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:42,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {69897#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69893#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:42,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {69901#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69897#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:42,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {69692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69901#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:42,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {69692#true} call #t~ret17 := main(); {69692#true} is VALID [2022-04-08 10:10:42,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69692#true} {69692#true} #94#return; {69692#true} is VALID [2022-04-08 10:10:42,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {69692#true} assume true; {69692#true} is VALID [2022-04-08 10:10:42,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {69692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69692#true} is VALID [2022-04-08 10:10:42,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {69692#true} call ULTIMATE.init(); {69692#true} is VALID [2022-04-08 10:10:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:10:42,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163394905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:42,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:42,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:10:42,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:42,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4060212] [2022-04-08 10:10:42,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4060212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:42,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:42,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:10:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439276542] [2022-04-08 10:10:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:10:42,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:42,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:42,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:42,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:10:42,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:10:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:10:42,423 INFO L87 Difference]: Start difference. First operand 473 states and 634 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:46,090 INFO L93 Difference]: Finished difference Result 558 states and 735 transitions. [2022-04-08 10:10:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:10:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:10:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 116 transitions. [2022-04-08 10:10:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 116 transitions. [2022-04-08 10:10:46,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 116 transitions. [2022-04-08 10:10:46,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:46,190 INFO L225 Difference]: With dead ends: 558 [2022-04-08 10:10:46,190 INFO L226 Difference]: Without dead ends: 540 [2022-04-08 10:10:46,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:10:46,190 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 97 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:46,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 96 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:10:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-04-08 10:10:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 473. [2022-04-08 10:10:48,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:48,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,366 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,367 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:48,375 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2022-04-08 10:10:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 716 transitions. [2022-04-08 10:10:48,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:48,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:48,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 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 540 states. [2022-04-08 10:10:48,376 INFO L87 Difference]: Start difference. First operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 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 540 states. [2022-04-08 10:10:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:48,384 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2022-04-08 10:10:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 716 transitions. [2022-04-08 10:10:48,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:48,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:48,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:48,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 468 states have (on average 1.3440170940170941) internal successors, (629), 468 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 633 transitions. [2022-04-08 10:10:48,394 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 633 transitions. Word has length 34 [2022-04-08 10:10:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:48,394 INFO L478 AbstractCegarLoop]: Abstraction has 473 states and 633 transitions. [2022-04-08 10:10:48,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:48,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 473 states and 633 transitions. [2022-04-08 10:10:50,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 633 transitions. [2022-04-08 10:10:50,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:50,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:50,190 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:50,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:50,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 10:10:50,395 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:50,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:50,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1035294218, now seen corresponding path program 33 times [2022-04-08 10:10:50,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:50,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [16088075] [2022-04-08 10:10:50,398 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:50,398 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1035294218, now seen corresponding path program 34 times [2022-04-08 10:10:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:50,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786818892] [2022-04-08 10:10:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:50,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {73110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-08 10:10:50,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-08 10:10:50,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-08 10:10:50,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {73086#true} call ULTIMATE.init(); {73110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:50,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {73110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-08 10:10:50,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-08 10:10:50,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-08 10:10:50,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {73086#true} call #t~ret17 := main(); {73086#true} is VALID [2022-04-08 10:10:50,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {73086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73091#(= main_~y~0 0)} is VALID [2022-04-08 10:10:50,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {73091#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:50,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {73092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:50,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {73093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:50,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {73094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:50,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {73095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:50,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {73096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:50,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {73097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:50,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {73098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:50,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {73099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:50,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {73100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:50,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {73101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:50,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {73102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:50,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {73103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:50,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {73104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:50,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {73105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:50,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {73106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73107#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:50,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {73107#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:50,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:50,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {73109#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:10:50,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {73109#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:50,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:50,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {73087#false} assume !(~x~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:50,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {73087#false} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:50,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:50,722 INFO L272 TraceCheckUtils]: 30: Hoare triple {73087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73087#false} is VALID [2022-04-08 10:10:50,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {73087#false} ~cond := #in~cond; {73087#false} is VALID [2022-04-08 10:10:50,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {73087#false} assume 0 == ~cond; {73087#false} is VALID [2022-04-08 10:10:50,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {73087#false} assume !false; {73087#false} is VALID [2022-04-08 10:10:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:50,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786818892] [2022-04-08 10:10:50,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786818892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:50,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218949907] [2022-04-08 10:10:50,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:50,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:50,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:50,723 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:50,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 10:10:50,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:50,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:50,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:10:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:50,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:51,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {73086#true} call ULTIMATE.init(); {73086#true} is VALID [2022-04-08 10:10:51,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {73086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-08 10:10:51,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-08 10:10:51,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-08 10:10:51,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {73086#true} call #t~ret17 := main(); {73086#true} is VALID [2022-04-08 10:10:51,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {73086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73091#(= main_~y~0 0)} is VALID [2022-04-08 10:10:51,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {73091#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:51,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {73092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:51,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {73093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:51,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {73094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:51,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {73095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:51,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {73096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:51,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {73097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:51,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {73098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:51,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {73099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:51,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {73100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:51,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {73101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:51,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {73102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:51,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {73103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:51,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {73104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:51,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {73105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:51,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {73106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73107#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:51,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {73107#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:51,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:51,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {73108#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {73186#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {73186#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {73087#false} assume !(~x~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {73087#false} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L272 TraceCheckUtils]: 30: Hoare triple {73087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {73087#false} ~cond := #in~cond; {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {73087#false} assume 0 == ~cond; {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {73087#false} assume !false; {73087#false} is VALID [2022-04-08 10:10:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:51,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:51,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {73087#false} assume !false; {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {73087#false} assume 0 == ~cond; {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {73087#false} ~cond := #in~cond; {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L272 TraceCheckUtils]: 30: Hoare triple {73087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {73087#false} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {73087#false} assume !(~x~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {73087#false} assume !(~y~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {73238#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73087#false} is VALID [2022-04-08 10:10:51,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {73242#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {73238#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:51,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {73242#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {73242#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:51,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {73249#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73242#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:51,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {73253#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73249#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:51,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {73257#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73253#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:51,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {73261#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73257#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:51,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {73265#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73261#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:51,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {73269#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73265#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:51,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {73273#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73269#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:51,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {73277#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73273#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:51,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {73281#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73277#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:51,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {73285#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73281#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:51,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {73289#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73285#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:51,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {73293#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73289#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:51,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {73297#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73293#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:51,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {73301#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73297#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:51,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {73305#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73301#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:51,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {73309#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73305#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:51,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {73313#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73309#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:10:51,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {73086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73313#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:10:51,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {73086#true} call #t~ret17 := main(); {73086#true} is VALID [2022-04-08 10:10:51,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73086#true} {73086#true} #94#return; {73086#true} is VALID [2022-04-08 10:10:51,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {73086#true} assume true; {73086#true} is VALID [2022-04-08 10:10:51,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {73086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73086#true} is VALID [2022-04-08 10:10:51,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {73086#true} call ULTIMATE.init(); {73086#true} is VALID [2022-04-08 10:10:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218949907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:51,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:51,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:10:51,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [16088075] [2022-04-08 10:10:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [16088075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:51,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:51,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:10:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166038773] [2022-04-08 10:10:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:51,674 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:10:51,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:51,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:51,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:51,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:10:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:10:51,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:10:51,693 INFO L87 Difference]: Start difference. First operand 473 states and 633 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:59,595 INFO L93 Difference]: Finished difference Result 668 states and 990 transitions. [2022-04-08 10:10:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:10:59,595 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 10:10:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-08 10:10:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:10:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-08 10:10:59,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 260 transitions. [2022-04-08 10:10:59,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:59,812 INFO L225 Difference]: With dead ends: 668 [2022-04-08 10:10:59,812 INFO L226 Difference]: Without dead ends: 647 [2022-04-08 10:10:59,813 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:10:59,813 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 221 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:59,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 205 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3534 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 10:10:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-04-08 10:11:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 498. [2022-04-08 10:11:02,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:02,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 647 states. Second operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,110 INFO L74 IsIncluded]: Start isIncluded. First operand 647 states. Second operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,111 INFO L87 Difference]: Start difference. First operand 647 states. Second operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:02,122 INFO L93 Difference]: Finished difference Result 647 states and 852 transitions. [2022-04-08 10:11:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 852 transitions. [2022-04-08 10:11:02,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:02,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:02,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 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 647 states. [2022-04-08 10:11:02,123 INFO L87 Difference]: Start difference. First operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 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 647 states. [2022-04-08 10:11:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:02,134 INFO L93 Difference]: Finished difference Result 647 states and 852 transitions. [2022-04-08 10:11:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 852 transitions. [2022-04-08 10:11:02,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:02,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:02,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:02,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 669 transitions. [2022-04-08 10:11:02,145 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 669 transitions. Word has length 34 [2022-04-08 10:11:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:02,145 INFO L478 AbstractCegarLoop]: Abstraction has 498 states and 669 transitions. [2022-04-08 10:11:02,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:02,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 498 states and 669 transitions. [2022-04-08 10:11:04,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 669 edges. 669 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 669 transitions. [2022-04-08 10:11:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:11:04,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:04,087 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:04,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:04,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 10:11:04,287 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:04,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 9 times [2022-04-08 10:11:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:04,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890050420] [2022-04-08 10:11:04,290 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:04,290 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 10 times [2022-04-08 10:11:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:04,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240264368] [2022-04-08 10:11:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:04,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {77016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-08 10:11:04,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-08 10:11:04,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-08 10:11:04,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {76998#true} call ULTIMATE.init(); {77016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:04,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {77016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-08 10:11:04,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-08 10:11:04,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-08 10:11:04,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {76998#true} call #t~ret17 := main(); {76998#true} is VALID [2022-04-08 10:11:04,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {76998#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:11:04,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:04,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77005#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:11:04,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {77005#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77006#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-08 10:11:04,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {77006#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {77007#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:11:04,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {77007#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {77008#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:11:04,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {77008#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:11:04,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-08 10:11:04,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-08 10:11:04,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:11:04,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:11:04,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-08 10:11:04,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-08 10:11:04,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:11:04,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:04,723 INFO L272 TraceCheckUtils]: 31: Hoare triple {77013#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:11:04,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {77014#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {77015#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:11:04,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {77015#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {76999#false} is VALID [2022-04-08 10:11:04,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {76999#false} assume !false; {76999#false} is VALID [2022-04-08 10:11:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:11:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:04,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240264368] [2022-04-08 10:11:04,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240264368] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:04,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239580164] [2022-04-08 10:11:04,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:04,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:04,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:04,725 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:04,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 10:11:04,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:04,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:04,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-08 10:11:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:04,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:17,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {76998#true} call ULTIMATE.init(); {76998#true} is VALID [2022-04-08 10:11:17,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {76998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-08 10:11:17,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-08 10:11:17,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-08 10:11:17,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {76998#true} call #t~ret17 := main(); {76998#true} is VALID [2022-04-08 10:11:17,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {76998#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:11:17,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {77003#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:17,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {77004#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77041#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:11:17,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {77041#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77045#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:17,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {77045#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {77049#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:17,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {77049#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} ~z~0 := ~y~0; {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:11:17,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:11:17,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:11:17,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:11:17,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:11:17,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {77065#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77072#(and (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:11:17,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {77072#(and (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77076#(and (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-08 10:11:17,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {77076#(and (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:11:17,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0))} assume !(~y~0 % 4294967296 > 0); {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:11:17,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {77080#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77087#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-08 10:11:17,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {77087#(and (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77091#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:11:17,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {77091#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~z~0 3) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:11:17,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:11:17,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {77053#(and (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:11:17,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {77057#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:11:17,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {77061#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:17,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:17,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {77011#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-08 10:11:17,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {77010#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:11:17,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {77009#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:17,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:11:17,738 INFO L272 TraceCheckUtils]: 31: Hoare triple {77012#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:11:17,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:11:17,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {77129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76999#false} is VALID [2022-04-08 10:11:17,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {76999#false} assume !false; {76999#false} is VALID [2022-04-08 10:11:17,739 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-08 10:11:17,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:18,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {76999#false} assume !false; {76999#false} is VALID [2022-04-08 10:11:18,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {77129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76999#false} is VALID [2022-04-08 10:11:18,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:11:18,947 INFO L272 TraceCheckUtils]: 31: Hoare triple {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:11:18,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:18,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:18,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:11:18,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:11:18,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:11:18,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77160#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:11:18,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77156#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:11:18,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {77152#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:11:18,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {77145#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:18,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {77180#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:18,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {77184#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77180#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:11:18,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {77184#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:11:18,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:11:18,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {77195#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77188#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:11:18,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {77199#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77195#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:11:18,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77199#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)))} is VALID [2022-04-08 10:11:18,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-08 10:11:18,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {77210#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77203#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-08 10:11:18,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {77214#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77210#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:11:18,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77214#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:11:18,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {77176#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:18,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:11:18,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {77228#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77221#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:11:18,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {77232#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77228#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:11:18,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {77236#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77232#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:11:18,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {76998#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77236#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:11:18,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {76998#true} call #t~ret17 := main(); {76998#true} is VALID [2022-04-08 10:11:18,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76998#true} {76998#true} #94#return; {76998#true} is VALID [2022-04-08 10:11:18,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {76998#true} assume true; {76998#true} is VALID [2022-04-08 10:11:18,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {76998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76998#true} is VALID [2022-04-08 10:11:18,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {76998#true} call ULTIMATE.init(); {76998#true} is VALID [2022-04-08 10:11:18,968 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-08 10:11:18,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239580164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:18,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:18,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 21] total 47 [2022-04-08 10:11:18,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:18,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890050420] [2022-04-08 10:11:18,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890050420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:18,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:18,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:11:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244024135] [2022-04-08 10:11:18,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:11:18,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:18,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:19,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:19,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:11:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:19,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:11:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1874, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:11:19,002 INFO L87 Difference]: Start difference. First operand 498 states and 669 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:24,243 INFO L93 Difference]: Finished difference Result 634 states and 808 transitions. [2022-04-08 10:11:24,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:11:24,243 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:11:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-08 10:11:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-08 10:11:24,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-04-08 10:11:24,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:24,412 INFO L225 Difference]: With dead ends: 634 [2022-04-08 10:11:24,412 INFO L226 Difference]: Without dead ends: 621 [2022-04-08 10:11:24,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=419, Invalid=3121, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:11:24,413 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:24,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 76 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:11:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-04-08 10:11:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 506. [2022-04-08 10:11:26,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:26,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 621 states. Second operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:26,864 INFO L74 IsIncluded]: Start isIncluded. First operand 621 states. Second operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:26,865 INFO L87 Difference]: Start difference. First operand 621 states. Second operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:26,875 INFO L93 Difference]: Finished difference Result 621 states and 794 transitions. [2022-04-08 10:11:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 794 transitions. [2022-04-08 10:11:26,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:26,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:26,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 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 621 states. [2022-04-08 10:11:26,877 INFO L87 Difference]: Start difference. First operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 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 621 states. [2022-04-08 10:11:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:26,888 INFO L93 Difference]: Finished difference Result 621 states and 794 transitions. [2022-04-08 10:11:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 794 transitions. [2022-04-08 10:11:26,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:26,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:26,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:26,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 501 states have (on average 1.347305389221557) internal successors, (675), 501 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 679 transitions. [2022-04-08 10:11:26,898 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 679 transitions. Word has length 35 [2022-04-08 10:11:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:26,899 INFO L478 AbstractCegarLoop]: Abstraction has 506 states and 679 transitions. [2022-04-08 10:11:26,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:26,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 506 states and 679 transitions. [2022-04-08 10:11:29,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 679 transitions. [2022-04-08 10:11:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:11:29,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:29,459 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:29,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:29,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:29,671 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash -53610471, now seen corresponding path program 17 times [2022-04-08 10:11:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:29,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285408025] [2022-04-08 10:11:29,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:29,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -53610471, now seen corresponding path program 18 times [2022-04-08 10:11:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:29,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029607416] [2022-04-08 10:11:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:29,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {80825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-08 10:11:29,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-08 10:11:29,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-08 10:11:29,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {80805#true} call ULTIMATE.init(); {80825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:29,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {80825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-08 10:11:29,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-08 10:11:29,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-08 10:11:29,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {80805#true} call #t~ret17 := main(); {80805#true} is VALID [2022-04-08 10:11:29,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {80805#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80810#(= main_~y~0 0)} is VALID [2022-04-08 10:11:29,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {80810#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80811#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:29,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {80811#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80812#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:29,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {80812#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80813#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:29,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {80813#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80814#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:29,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {80814#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80815#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:29,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {80815#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:29,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:29,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {80816#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {80817#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:29,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {80817#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:29,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {80818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80819#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:11:29,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {80819#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80820#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:11:29,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {80820#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80821#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:11:29,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {80821#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80822#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:11:29,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {80822#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80823#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:11:29,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {80823#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80823#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:11:29,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {80823#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80822#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:11:29,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {80822#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80821#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:11:29,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {80821#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80820#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:11:29,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {80820#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80819#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:11:29,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {80819#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:29,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {80818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:29,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:29,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:29,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {80824#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:29,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {80806#false} assume !(~y~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:29,938 INFO L272 TraceCheckUtils]: 31: Hoare triple {80806#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80806#false} is VALID [2022-04-08 10:11:29,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {80806#false} ~cond := #in~cond; {80806#false} is VALID [2022-04-08 10:11:29,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {80806#false} assume 0 == ~cond; {80806#false} is VALID [2022-04-08 10:11:29,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {80806#false} assume !false; {80806#false} is VALID [2022-04-08 10:11:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029607416] [2022-04-08 10:11:29,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029607416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448521900] [2022-04-08 10:11:29,939 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:29,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:29,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:29,940 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:29,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 10:11:29,998 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:11:29,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:29,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:11:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:30,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:30,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {80805#true} call ULTIMATE.init(); {80805#true} is VALID [2022-04-08 10:11:30,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {80805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-08 10:11:30,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-08 10:11:30,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-08 10:11:30,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {80805#true} call #t~ret17 := main(); {80805#true} is VALID [2022-04-08 10:11:30,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {80805#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80805#true} is VALID [2022-04-08 10:11:30,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {80805#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:30,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:30,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:30,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:30,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:30,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:30,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:30,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:30,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:30,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:30,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:30,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:30,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:30,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:30,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {80806#false} assume !(~z~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:30,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {80806#false} assume !(~y~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:30,254 INFO L272 TraceCheckUtils]: 31: Hoare triple {80806#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80806#false} is VALID [2022-04-08 10:11:30,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {80806#false} ~cond := #in~cond; {80806#false} is VALID [2022-04-08 10:11:30,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {80806#false} assume 0 == ~cond; {80806#false} is VALID [2022-04-08 10:11:30,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {80806#false} assume !false; {80806#false} is VALID [2022-04-08 10:11:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:11:30,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:30,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {80806#false} assume !false; {80806#false} is VALID [2022-04-08 10:11:30,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {80806#false} assume 0 == ~cond; {80806#false} is VALID [2022-04-08 10:11:30,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {80806#false} ~cond := #in~cond; {80806#false} is VALID [2022-04-08 10:11:30,402 INFO L272 TraceCheckUtils]: 31: Hoare triple {80806#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80806#false} is VALID [2022-04-08 10:11:30,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {80806#false} assume !(~y~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:30,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {80806#false} assume !(~z~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:30,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {80806#false} is VALID [2022-04-08 10:11:30,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {80892#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80892#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:11:30,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:30,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:30,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:30,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:30,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:30,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:30,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:30,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80867#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:11:30,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80863#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:11:30,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80859#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:11:30,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80855#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:11:30,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80851#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:11:30,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {80805#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80847#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:11:30,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {80805#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80805#true} is VALID [2022-04-08 10:11:30,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {80805#true} call #t~ret17 := main(); {80805#true} is VALID [2022-04-08 10:11:30,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80805#true} {80805#true} #94#return; {80805#true} is VALID [2022-04-08 10:11:30,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {80805#true} assume true; {80805#true} is VALID [2022-04-08 10:11:30,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {80805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80805#true} is VALID [2022-04-08 10:11:30,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {80805#true} call ULTIMATE.init(); {80805#true} is VALID [2022-04-08 10:11:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:11:30,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448521900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:30,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:30,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-08 10:11:30,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:30,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285408025] [2022-04-08 10:11:30,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285408025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:30,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:30,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:11:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366364550] [2022-04-08 10:11:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:11:30,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:30,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:30,437 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-08 10:11:30,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:11:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:11:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:11:30,438 INFO L87 Difference]: Start difference. First operand 506 states and 679 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:41,919 INFO L93 Difference]: Finished difference Result 874 states and 1246 transitions. [2022-04-08 10:11:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-08 10:11:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:11:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 324 transitions. [2022-04-08 10:11:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 324 transitions. [2022-04-08 10:11:41,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 324 transitions. [2022-04-08 10:11:42,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:42,202 INFO L225 Difference]: With dead ends: 874 [2022-04-08 10:11:42,202 INFO L226 Difference]: Without dead ends: 804 [2022-04-08 10:11:42,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=467, Invalid=7365, Unknown=0, NotChecked=0, Total=7832 [2022-04-08 10:11:42,203 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 146 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:42,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 119 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 10:11:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-04-08 10:11:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 551. [2022-04-08 10:11:45,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:45,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 804 states. Second operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:45,118 INFO L74 IsIncluded]: Start isIncluded. First operand 804 states. Second operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:45,118 INFO L87 Difference]: Start difference. First operand 804 states. Second operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:45,136 INFO L93 Difference]: Finished difference Result 804 states and 1003 transitions. [2022-04-08 10:11:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1003 transitions. [2022-04-08 10:11:45,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:45,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:45,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 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 804 states. [2022-04-08 10:11:45,137 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 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 804 states. [2022-04-08 10:11:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:45,155 INFO L93 Difference]: Finished difference Result 804 states and 1003 transitions. [2022-04-08 10:11:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1003 transitions. [2022-04-08 10:11:45,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:45,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:45,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:45,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.3516483516483517) internal successors, (738), 546 states have internal predecessors, (738), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 742 transitions. [2022-04-08 10:11:45,168 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 742 transitions. Word has length 35 [2022-04-08 10:11:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:45,168 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 742 transitions. [2022-04-08 10:11:45,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:45,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 742 transitions. [2022-04-08 10:11:47,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 742 edges. 742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 742 transitions. [2022-04-08 10:11:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:11:47,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:47,507 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:47,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:47,708 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-08 10:11:47,708 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash 996979513, now seen corresponding path program 35 times [2022-04-08 10:11:47,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:47,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [228793614] [2022-04-08 10:11:47,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:47,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash 996979513, now seen corresponding path program 36 times [2022-04-08 10:11:47,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:47,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074462364] [2022-04-08 10:11:47,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:47,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:48,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {85653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-08 10:11:48,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-08 10:11:48,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-08 10:11:48,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {85628#true} call ULTIMATE.init(); {85653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:48,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {85653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-08 10:11:48,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-08 10:11:48,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-08 10:11:48,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {85628#true} call #t~ret17 := main(); {85628#true} is VALID [2022-04-08 10:11:48,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {85628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85633#(= main_~y~0 0)} is VALID [2022-04-08 10:11:48,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {85633#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85634#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:48,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {85634#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85635#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:48,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {85635#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85636#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:48,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {85636#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85637#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:48,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {85637#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85638#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:48,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {85638#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85639#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:48,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {85639#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85640#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:48,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {85640#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85641#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:48,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {85641#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85642#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:48,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {85642#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85643#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:48,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {85643#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85644#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:48,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {85644#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85645#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:48,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {85645#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85646#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:48,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {85646#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85647#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:48,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {85647#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85648#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:48,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {85648#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85649#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:48,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {85649#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85650#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:48,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {85650#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:48,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:48,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {85652#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-08 10:11:48,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {85652#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {85629#false} assume !(~x~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {85629#false} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,029 INFO L272 TraceCheckUtils]: 31: Hoare triple {85629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {85629#false} is VALID [2022-04-08 10:11:48,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {85629#false} ~cond := #in~cond; {85629#false} is VALID [2022-04-08 10:11:48,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {85629#false} assume 0 == ~cond; {85629#false} is VALID [2022-04-08 10:11:48,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {85629#false} assume !false; {85629#false} is VALID [2022-04-08 10:11:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:48,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:48,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074462364] [2022-04-08 10:11:48,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074462364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:48,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323736007] [2022-04-08 10:11:48,030 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:48,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:48,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:48,031 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:48,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 10:11:48,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:11:48,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:48,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:11:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:48,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:48,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {85628#true} call ULTIMATE.init(); {85628#true} is VALID [2022-04-08 10:11:48,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {85628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-08 10:11:48,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-08 10:11:48,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-08 10:11:48,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {85628#true} call #t~ret17 := main(); {85628#true} is VALID [2022-04-08 10:11:48,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {85628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85633#(= main_~y~0 0)} is VALID [2022-04-08 10:11:48,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {85633#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85634#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:48,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {85634#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85635#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:48,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {85635#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85636#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:48,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {85636#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85637#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:48,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {85637#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85638#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:48,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {85638#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85639#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:48,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {85639#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85640#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:48,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {85640#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85641#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:48,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {85641#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85642#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:48,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {85642#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85643#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:48,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {85643#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85644#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:48,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {85644#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85645#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:48,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {85645#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85646#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:48,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {85646#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85647#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:48,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {85647#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85648#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:48,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {85648#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85649#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:48,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {85649#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85650#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:48,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {85650#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:48,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:48,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {85651#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {85732#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:11:48,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {85732#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {85629#false} assume !(~x~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {85629#false} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:48,608 INFO L272 TraceCheckUtils]: 31: Hoare triple {85629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {85629#false} is VALID [2022-04-08 10:11:48,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {85629#false} ~cond := #in~cond; {85629#false} is VALID [2022-04-08 10:11:48,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {85629#false} assume 0 == ~cond; {85629#false} is VALID [2022-04-08 10:11:48,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {85629#false} assume !false; {85629#false} is VALID [2022-04-08 10:11:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:48,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:49,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {85629#false} assume !false; {85629#false} is VALID [2022-04-08 10:11:49,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {85629#false} assume 0 == ~cond; {85629#false} is VALID [2022-04-08 10:11:49,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {85629#false} ~cond := #in~cond; {85629#false} is VALID [2022-04-08 10:11:49,326 INFO L272 TraceCheckUtils]: 31: Hoare triple {85629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {85629#false} is VALID [2022-04-08 10:11:49,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:49,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {85629#false} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:49,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {85629#false} assume !(~x~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:49,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {85629#false} assume !(~y~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:49,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {85784#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85629#false} is VALID [2022-04-08 10:11:49,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {85788#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {85784#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:49,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {85788#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85788#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:49,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {85795#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85788#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:49,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {85799#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85795#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:49,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {85803#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85799#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:49,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {85807#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85803#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:49,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {85811#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85807#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:49,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {85815#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85811#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:49,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {85819#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85815#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:49,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {85823#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85819#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:49,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {85827#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85823#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:49,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {85831#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85827#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:49,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {85835#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85831#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:49,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {85839#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85835#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:49,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {85843#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85839#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:49,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {85847#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85843#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:49,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {85851#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85847#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:49,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {85855#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85851#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:49,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {85859#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85855#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:49,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {85863#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85859#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:11:49,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {85628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85863#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:11:49,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {85628#true} call #t~ret17 := main(); {85628#true} is VALID [2022-04-08 10:11:49,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85628#true} {85628#true} #94#return; {85628#true} is VALID [2022-04-08 10:11:49,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {85628#true} assume true; {85628#true} is VALID [2022-04-08 10:11:49,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {85628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85628#true} is VALID [2022-04-08 10:11:49,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {85628#true} call ULTIMATE.init(); {85628#true} is VALID [2022-04-08 10:11:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:49,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323736007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:49,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:49,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:11:49,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:49,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [228793614] [2022-04-08 10:11:49,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [228793614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:49,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:49,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:11:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524229676] [2022-04-08 10:11:49,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:49,342 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:11:49,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:49,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:49,364 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-08 10:11:49,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:11:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:49,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:11:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:11:49,365 INFO L87 Difference]: Start difference. First operand 551 states and 742 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:58,790 INFO L93 Difference]: Finished difference Result 764 states and 1129 transitions. [2022-04-08 10:11:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:11:58,790 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 10:11:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 273 transitions. [2022-04-08 10:11:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:11:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 273 transitions. [2022-04-08 10:11:58,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 273 transitions. [2022-04-08 10:11:58,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:59,017 INFO L225 Difference]: With dead ends: 764 [2022-04-08 10:11:59,017 INFO L226 Difference]: Without dead ends: 743 [2022-04-08 10:11:59,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:11:59,018 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 234 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3939 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 3939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:59,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 216 Invalid, 4092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3939 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 10:11:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-04-08 10:12:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 578. [2022-04-08 10:12:02,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:02,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 743 states. Second operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,088 INFO L74 IsIncluded]: Start isIncluded. First operand 743 states. Second operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,089 INFO L87 Difference]: Start difference. First operand 743 states. Second operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,103 INFO L93 Difference]: Finished difference Result 743 states and 982 transitions. [2022-04-08 10:12:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 982 transitions. [2022-04-08 10:12:02,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 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 743 states. [2022-04-08 10:12:02,104 INFO L87 Difference]: Start difference. First operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 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 743 states. [2022-04-08 10:12:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,118 INFO L93 Difference]: Finished difference Result 743 states and 982 transitions. [2022-04-08 10:12:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 982 transitions. [2022-04-08 10:12:02,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:02,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 573 states have (on average 1.356020942408377) internal successors, (777), 573 states have internal predecessors, (777), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 781 transitions. [2022-04-08 10:12:02,132 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 781 transitions. Word has length 35 [2022-04-08 10:12:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:02,132 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 781 transitions. [2022-04-08 10:12:02,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:02,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 781 transitions. [2022-04-08 10:12:04,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 781 edges. 781 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 781 transitions. [2022-04-08 10:12:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:12:04,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:04,468 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:04,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-08 10:12:04,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:04,672 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1961738437, now seen corresponding path program 19 times [2022-04-08 10:12:04,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:04,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105218258] [2022-04-08 10:12:04,675 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:04,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1961738437, now seen corresponding path program 20 times [2022-04-08 10:12:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:04,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582989132] [2022-04-08 10:12:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:04,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:04,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {90113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-08 10:12:04,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-08 10:12:04,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-08 10:12:04,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {90094#true} call ULTIMATE.init(); {90113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:04,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {90113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-08 10:12:04,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-08 10:12:04,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-08 10:12:04,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {90094#true} call #t~ret17 := main(); {90094#true} is VALID [2022-04-08 10:12:04,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {90094#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90099#(= main_~y~0 0)} is VALID [2022-04-08 10:12:04,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {90099#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90100#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:04,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {90100#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90101#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:04,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {90101#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90102#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:04,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {90102#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90103#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:04,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {90103#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90104#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:04,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {90104#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90105#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:04,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {90105#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:04,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:04,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {90106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {90107#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:04,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {90107#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90108#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:04,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {90108#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90109#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:04,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {90109#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90110#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:12:04,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {90110#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90111#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:12:04,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {90111#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90112#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:12:04,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {90112#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:04,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-08 10:12:04,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-08 10:12:04,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-08 10:12:04,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-08 10:12:04,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {90095#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {90095#false} assume !(~x~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {90095#false} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L272 TraceCheckUtils]: 32: Hoare triple {90095#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {90095#false} ~cond := #in~cond; {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {90095#false} assume 0 == ~cond; {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {90095#false} assume !false; {90095#false} is VALID [2022-04-08 10:12:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:12:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:04,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582989132] [2022-04-08 10:12:04,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582989132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:04,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328032483] [2022-04-08 10:12:04,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:04,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:04,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:04,890 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:04,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 10:12:04,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:04,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:04,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:12:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:04,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:05,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {90094#true} call ULTIMATE.init(); {90094#true} is VALID [2022-04-08 10:12:05,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {90094#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-08 10:12:05,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-08 10:12:05,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-08 10:12:05,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {90094#true} call #t~ret17 := main(); {90094#true} is VALID [2022-04-08 10:12:05,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {90094#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90094#true} is VALID [2022-04-08 10:12:05,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-08 10:12:05,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-08 10:12:05,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:05,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:05,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:05,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:05,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:05,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:05,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:05,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:05,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:05,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:05,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:05,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:05,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {90095#false} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:05,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:05,150 INFO L272 TraceCheckUtils]: 32: Hoare triple {90095#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90095#false} is VALID [2022-04-08 10:12:05,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {90095#false} ~cond := #in~cond; {90095#false} is VALID [2022-04-08 10:12:05,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {90095#false} assume 0 == ~cond; {90095#false} is VALID [2022-04-08 10:12:05,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {90095#false} assume !false; {90095#false} is VALID [2022-04-08 10:12:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:12:05,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:05,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {90095#false} assume !false; {90095#false} is VALID [2022-04-08 10:12:05,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {90095#false} assume 0 == ~cond; {90095#false} is VALID [2022-04-08 10:12:05,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {90095#false} ~cond := #in~cond; {90095#false} is VALID [2022-04-08 10:12:05,254 INFO L272 TraceCheckUtils]: 32: Hoare triple {90095#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90095#false} is VALID [2022-04-08 10:12:05,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {90095#false} assume !(~y~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:05,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {90095#false} assume !(~z~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:05,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {90095#false} is VALID [2022-04-08 10:12:05,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {90179#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90179#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:12:05,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:05,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:05,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:05,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:05,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:05,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:05,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90157#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:12:05,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90153#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:12:05,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90149#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:12:05,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90145#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:12:05,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90141#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:12:05,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-08 10:12:05,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {90094#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90094#true} is VALID [2022-04-08 10:12:05,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {90094#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90094#true} is VALID [2022-04-08 10:12:05,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {90094#true} call #t~ret17 := main(); {90094#true} is VALID [2022-04-08 10:12:05,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90094#true} {90094#true} #94#return; {90094#true} is VALID [2022-04-08 10:12:05,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {90094#true} assume true; {90094#true} is VALID [2022-04-08 10:12:05,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {90094#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90094#true} is VALID [2022-04-08 10:12:05,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {90094#true} call ULTIMATE.init(); {90094#true} is VALID [2022-04-08 10:12:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:12:05,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328032483] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:05,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:05,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 23 [2022-04-08 10:12:05,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:05,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105218258] [2022-04-08 10:12:05,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105218258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:05,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:05,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:12:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113044119] [2022-04-08 10:12:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:05,266 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:12:05,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:05,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:05,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:05,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:12:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:12:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:12:05,285 INFO L87 Difference]: Start difference. First operand 578 states and 781 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:10,853 INFO L93 Difference]: Finished difference Result 719 states and 979 transitions. [2022-04-08 10:12:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:12:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:12:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 136 transitions. [2022-04-08 10:12:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 136 transitions. [2022-04-08 10:12:10,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 136 transitions. [2022-04-08 10:12:10,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:10,982 INFO L225 Difference]: With dead ends: 719 [2022-04-08 10:12:10,982 INFO L226 Difference]: Without dead ends: 612 [2022-04-08 10:12:10,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=2320, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 10:12:10,983 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:10,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 118 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:12:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-04-08 10:12:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 579. [2022-04-08 10:12:14,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:14,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 612 states. Second operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:14,053 INFO L74 IsIncluded]: Start isIncluded. First operand 612 states. Second operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:14,054 INFO L87 Difference]: Start difference. First operand 612 states. Second operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:14,064 INFO L93 Difference]: Finished difference Result 612 states and 828 transitions. [2022-04-08 10:12:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 828 transitions. [2022-04-08 10:12:14,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:14,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:14,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 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 612 states. [2022-04-08 10:12:14,065 INFO L87 Difference]: Start difference. First operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 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 612 states. [2022-04-08 10:12:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:14,076 INFO L93 Difference]: Finished difference Result 612 states and 828 transitions. [2022-04-08 10:12:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 828 transitions. [2022-04-08 10:12:14,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:14,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:14,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:14,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 574 states have (on average 1.3501742160278745) internal successors, (775), 574 states have internal predecessors, (775), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 779 transitions. [2022-04-08 10:12:14,089 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 779 transitions. Word has length 36 [2022-04-08 10:12:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:14,089 INFO L478 AbstractCegarLoop]: Abstraction has 579 states and 779 transitions. [2022-04-08 10:12:14,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:14,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 579 states and 779 transitions. [2022-04-08 10:12:16,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 779 transitions. [2022-04-08 10:12:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:12:16,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:16,441 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:16,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:16,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:16,641 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2089881717, now seen corresponding path program 11 times [2022-04-08 10:12:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:16,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622410701] [2022-04-08 10:12:16,644 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:16,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2089881717, now seen corresponding path program 12 times [2022-04-08 10:12:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:16,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474343164] [2022-04-08 10:12:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:16,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:16,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {94227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-08 10:12:16,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-08 10:12:16,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-08 10:12:16,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {94211#true} call ULTIMATE.init(); {94227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:16,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {94227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-08 10:12:16,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-08 10:12:16,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-08 10:12:16,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {94211#true} call #t~ret17 := main(); {94211#true} is VALID [2022-04-08 10:12:16,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {94211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94216#(= main_~y~0 0)} is VALID [2022-04-08 10:12:16,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {94216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:16,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {94217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:16,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {94218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:16,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {94219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:16,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {94220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:16,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {94221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:16,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {94222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:16,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {94223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:16,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:16,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {94225#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:16,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {94225#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94226#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:16,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {94226#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:16,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {94212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {94212#false} assume !(~x~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {94212#false} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L272 TraceCheckUtils]: 32: Hoare triple {94212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {94212#false} ~cond := #in~cond; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {94212#false} assume 0 == ~cond; {94212#false} is VALID [2022-04-08 10:12:16,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {94212#false} assume !false; {94212#false} is VALID [2022-04-08 10:12:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 10:12:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:16,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474343164] [2022-04-08 10:12:16,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474343164] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:16,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222503112] [2022-04-08 10:12:16,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:16,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:16,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:16,818 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:16,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 10:12:16,934 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:12:16,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:16,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:12:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:16,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:17,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {94211#true} call ULTIMATE.init(); {94211#true} is VALID [2022-04-08 10:12:17,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {94211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-08 10:12:17,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-08 10:12:17,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-08 10:12:17,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {94211#true} call #t~ret17 := main(); {94211#true} is VALID [2022-04-08 10:12:17,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {94211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94216#(= main_~y~0 0)} is VALID [2022-04-08 10:12:17,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {94216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:17,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {94217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:17,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {94218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:17,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {94219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:17,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {94220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:17,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {94221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:17,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {94222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:17,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {94223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:17,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:17,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {94224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {94225#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:17,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {94225#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94279#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:17,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {94279#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {94212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {94212#false} assume !(~x~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {94212#false} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {94212#false} is VALID [2022-04-08 10:12:17,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,198 INFO L272 TraceCheckUtils]: 32: Hoare triple {94212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94212#false} is VALID [2022-04-08 10:12:17,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {94212#false} ~cond := #in~cond; {94212#false} is VALID [2022-04-08 10:12:17,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {94212#false} assume 0 == ~cond; {94212#false} is VALID [2022-04-08 10:12:17,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {94212#false} assume !false; {94212#false} is VALID [2022-04-08 10:12:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 10:12:17,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:17,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {94212#false} assume !false; {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {94212#false} assume 0 == ~cond; {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {94212#false} ~cond := #in~cond; {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L272 TraceCheckUtils]: 32: Hoare triple {94212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {94212#false} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {94212#false} assume !(~x~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {94212#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {94212#false} assume !(~y~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {94212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94212#false} is VALID [2022-04-08 10:12:17,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {94391#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94212#false} is VALID [2022-04-08 10:12:17,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {94395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94391#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:17,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {94395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:17,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:17,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {94406#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94399#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:17,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {94410#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94406#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:17,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {94414#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94410#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:17,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {94418#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94414#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:17,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {94422#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94418#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:17,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {94426#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94422#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:17,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {94430#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94426#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:17,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {94434#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94430#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:17,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {94211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94434#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:17,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {94211#true} call #t~ret17 := main(); {94211#true} is VALID [2022-04-08 10:12:17,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94211#true} {94211#true} #94#return; {94211#true} is VALID [2022-04-08 10:12:17,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {94211#true} assume true; {94211#true} is VALID [2022-04-08 10:12:17,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {94211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94211#true} is VALID [2022-04-08 10:12:17,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {94211#true} call ULTIMATE.init(); {94211#true} is VALID [2022-04-08 10:12:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 10:12:17,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222503112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:17,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:17,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:12:17,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:17,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622410701] [2022-04-08 10:12:17,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622410701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:17,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:17,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:12:17,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902844725] [2022-04-08 10:12:17,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:12:17,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:17,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:17,494 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-08 10:12:17,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:12:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:12:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:12:17,495 INFO L87 Difference]: Start difference. First operand 579 states and 779 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:22,375 INFO L93 Difference]: Finished difference Result 672 states and 890 transitions. [2022-04-08 10:12:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:12:22,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:12:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-08 10:12:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-08 10:12:22,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 127 transitions. [2022-04-08 10:12:22,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:22,486 INFO L225 Difference]: With dead ends: 672 [2022-04-08 10:12:22,486 INFO L226 Difference]: Without dead ends: 653 [2022-04-08 10:12:22,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:12:22,487 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:22,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 107 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:12:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-04-08 10:12:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 579. [2022-04-08 10:12:25,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:25,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 653 states. Second operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:25,569 INFO L74 IsIncluded]: Start isIncluded. First operand 653 states. Second operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:25,569 INFO L87 Difference]: Start difference. First operand 653 states. Second operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:25,580 INFO L93 Difference]: Finished difference Result 653 states and 870 transitions. [2022-04-08 10:12:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 870 transitions. [2022-04-08 10:12:25,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:25,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:25,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 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 653 states. [2022-04-08 10:12:25,582 INFO L87 Difference]: Start difference. First operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 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 653 states. [2022-04-08 10:12:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:25,593 INFO L93 Difference]: Finished difference Result 653 states and 870 transitions. [2022-04-08 10:12:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 870 transitions. [2022-04-08 10:12:25,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:25,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:25,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:25,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 574 states have (on average 1.348432055749129) internal successors, (774), 574 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 778 transitions. [2022-04-08 10:12:25,610 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 778 transitions. Word has length 36 [2022-04-08 10:12:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:25,610 INFO L478 AbstractCegarLoop]: Abstraction has 579 states and 778 transitions. [2022-04-08 10:12:25,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:25,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 579 states and 778 transitions. [2022-04-08 10:12:27,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 778 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 778 transitions. [2022-04-08 10:12:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:12:27,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:27,934 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:27,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:28,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-08 10:12:28,135 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:28,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash -427044266, now seen corresponding path program 37 times [2022-04-08 10:12:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:28,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874215060] [2022-04-08 10:12:28,137 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:28,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -427044266, now seen corresponding path program 38 times [2022-04-08 10:12:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:28,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920889510] [2022-04-08 10:12:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:28,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {98313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-08 10:12:28,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-08 10:12:28,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-08 10:12:28,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {98287#true} call ULTIMATE.init(); {98313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:28,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {98313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-08 10:12:28,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-08 10:12:28,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-08 10:12:28,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {98287#true} call #t~ret17 := main(); {98287#true} is VALID [2022-04-08 10:12:28,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {98287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98292#(= main_~y~0 0)} is VALID [2022-04-08 10:12:28,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {98292#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:28,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {98293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:28,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {98294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:28,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {98295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:28,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {98296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:28,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {98297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:28,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {98298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:28,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {98299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:28,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {98300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:28,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {98301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:28,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {98302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:28,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {98303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:28,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {98304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:28,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {98305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98306#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:28,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {98306#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98307#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:28,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {98307#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98308#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:28,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {98308#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98309#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:12:28,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {98309#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98310#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:12:28,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {98310#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:28,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:28,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {98312#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:28,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {98312#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {98288#false} assume !(~x~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {98288#false} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,496 INFO L272 TraceCheckUtils]: 32: Hoare triple {98288#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98288#false} is VALID [2022-04-08 10:12:28,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {98288#false} ~cond := #in~cond; {98288#false} is VALID [2022-04-08 10:12:28,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {98288#false} assume 0 == ~cond; {98288#false} is VALID [2022-04-08 10:12:28,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {98288#false} assume !false; {98288#false} is VALID [2022-04-08 10:12:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:12:28,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:28,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920889510] [2022-04-08 10:12:28,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920889510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:28,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064447251] [2022-04-08 10:12:28,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:28,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:28,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:28,498 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:28,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 10:12:28,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:28,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:28,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:12:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:28,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:28,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {98287#true} call ULTIMATE.init(); {98287#true} is VALID [2022-04-08 10:12:28,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {98287#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-08 10:12:28,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-08 10:12:28,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-08 10:12:28,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {98287#true} call #t~ret17 := main(); {98287#true} is VALID [2022-04-08 10:12:28,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {98287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98292#(= main_~y~0 0)} is VALID [2022-04-08 10:12:28,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {98292#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:28,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {98293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:28,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {98294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:28,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {98295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:28,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {98296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:28,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {98297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:28,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {98298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:28,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {98299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:28,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {98300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:28,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {98301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:28,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {98302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:28,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {98303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:28,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {98304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:12:28,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {98305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98306#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:12:28,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {98306#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98307#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:12:28,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {98307#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98308#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:12:28,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {98308#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98309#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:12:28,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {98309#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98310#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:12:28,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {98310#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:28,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:12:28,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {98311#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {98395#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:12:28,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {98395#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {98288#false} assume !(~x~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {98288#false} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:28,861 INFO L272 TraceCheckUtils]: 32: Hoare triple {98288#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98288#false} is VALID [2022-04-08 10:12:28,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {98288#false} ~cond := #in~cond; {98288#false} is VALID [2022-04-08 10:12:28,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {98288#false} assume 0 == ~cond; {98288#false} is VALID [2022-04-08 10:12:28,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {98288#false} assume !false; {98288#false} is VALID [2022-04-08 10:12:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:12:28,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:29,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {98288#false} assume !false; {98288#false} is VALID [2022-04-08 10:12:29,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {98288#false} assume 0 == ~cond; {98288#false} is VALID [2022-04-08 10:12:29,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {98288#false} ~cond := #in~cond; {98288#false} is VALID [2022-04-08 10:12:29,570 INFO L272 TraceCheckUtils]: 32: Hoare triple {98288#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98288#false} is VALID [2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {98288#false} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {98288#false} assume !(~x~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {98288#false} assume !(~y~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {98447#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {98288#false} is VALID [2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {98451#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {98447#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:29,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {98451#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {98451#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:29,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {98458#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98451#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:29,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {98462#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98458#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:29,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {98466#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98462#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:29,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {98470#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98466#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:29,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {98474#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98470#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:29,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {98478#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98474#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:29,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {98482#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98478#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:29,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {98486#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98482#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:29,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {98490#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98486#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:29,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {98494#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98490#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:29,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {98498#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98494#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:29,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {98502#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98498#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:12:29,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {98506#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98502#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:12:29,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {98510#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98506#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:12:29,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {98514#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98510#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:12:29,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {98518#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98514#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:12:29,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {98522#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98518#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:12:29,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {98526#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98522#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:12:29,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {98530#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98526#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:12:29,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {98287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98530#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:29,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {98287#true} call #t~ret17 := main(); {98287#true} is VALID [2022-04-08 10:12:29,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98287#true} {98287#true} #94#return; {98287#true} is VALID [2022-04-08 10:12:29,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {98287#true} assume true; {98287#true} is VALID [2022-04-08 10:12:29,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {98287#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98287#true} is VALID [2022-04-08 10:12:29,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {98287#true} call ULTIMATE.init(); {98287#true} is VALID [2022-04-08 10:12:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:12:29,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064447251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:29,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:29,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:12:29,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874215060] [2022-04-08 10:12:29,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874215060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:29,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:29,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:12:29,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814610212] [2022-04-08 10:12:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:29,586 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:12:29,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:29,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:29,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:29,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:12:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:12:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:12:29,606 INFO L87 Difference]: Start difference. First operand 579 states and 778 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:39,818 INFO L93 Difference]: Finished difference Result 800 states and 1181 transitions. [2022-04-08 10:12:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:12:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 10:12:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 286 transitions. [2022-04-08 10:12:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 286 transitions. [2022-04-08 10:12:39,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 286 transitions. [2022-04-08 10:12:40,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:40,060 INFO L225 Difference]: With dead ends: 800 [2022-04-08 10:12:40,060 INFO L226 Difference]: Without dead ends: 779 [2022-04-08 10:12:40,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:12:40,063 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 248 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4366 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 4366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:40,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 227 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 4366 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-08 10:12:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-08 10:12:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 606. [2022-04-08 10:12:43,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:43,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:43,272 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:43,272 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:43,289 INFO L93 Difference]: Finished difference Result 779 states and 1028 transitions. [2022-04-08 10:12:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1028 transitions. [2022-04-08 10:12:43,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:43,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:43,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 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 779 states. [2022-04-08 10:12:43,290 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 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 779 states. [2022-04-08 10:12:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:43,307 INFO L93 Difference]: Finished difference Result 779 states and 1028 transitions. [2022-04-08 10:12:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1028 transitions. [2022-04-08 10:12:43,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:43,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:43,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:43,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3527454242928452) internal successors, (813), 601 states have internal predecessors, (813), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 817 transitions. [2022-04-08 10:12:43,322 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 817 transitions. Word has length 36 [2022-04-08 10:12:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:43,322 INFO L478 AbstractCegarLoop]: Abstraction has 606 states and 817 transitions. [2022-04-08 10:12:43,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:43,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 817 transitions. [2022-04-08 10:12:45,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 817 edges. 817 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 817 transitions. [2022-04-08 10:12:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:12:45,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:45,726 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:45,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:45,942 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-08 10:12:45,942 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash -122316104, now seen corresponding path program 11 times [2022-04-08 10:12:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:45,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914411862] [2022-04-08 10:12:45,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:45,945 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -122316104, now seen corresponding path program 12 times [2022-04-08 10:12:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:45,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453999829] [2022-04-08 10:12:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:46,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {102972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-08 10:12:46,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-08 10:12:46,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {102963#true} call ULTIMATE.init(); {102972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:46,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {102972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {102963#true} call #t~ret17 := main(); {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {102963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {102963#true} assume !(~x~0 % 4294967296 > 0); {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:46,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:46,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {102964#false} assume !(~x~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {102964#false} assume !(~z~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {102964#false} assume !(~y~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,025 INFO L272 TraceCheckUtils]: 33: Hoare triple {102964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {102964#false} is VALID [2022-04-08 10:12:46,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {102964#false} ~cond := #in~cond; {102964#false} is VALID [2022-04-08 10:12:46,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {102964#false} assume 0 == ~cond; {102964#false} is VALID [2022-04-08 10:12:46,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {102964#false} assume !false; {102964#false} is VALID [2022-04-08 10:12:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:12:46,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:46,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453999829] [2022-04-08 10:12:46,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453999829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:46,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512318612] [2022-04-08 10:12:46,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:46,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:46,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:46,026 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:46,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 10:12:46,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:12:46,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:46,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:12:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:46,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:46,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {102963#true} call ULTIMATE.init(); {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {102963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {102963#true} call #t~ret17 := main(); {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {102963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {102963#true} assume !(~x~0 % 4294967296 > 0); {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:46,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:46,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {102964#false} assume !(~x~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {102964#false} assume !(~z~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {102964#false} assume !(~y~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,320 INFO L272 TraceCheckUtils]: 33: Hoare triple {102964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {102964#false} is VALID [2022-04-08 10:12:46,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {102964#false} ~cond := #in~cond; {102964#false} is VALID [2022-04-08 10:12:46,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {102964#false} assume 0 == ~cond; {102964#false} is VALID [2022-04-08 10:12:46,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {102964#false} assume !false; {102964#false} is VALID [2022-04-08 10:12:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:12:46,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {102964#false} assume !false; {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {102964#false} assume 0 == ~cond; {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {102964#false} ~cond := #in~cond; {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L272 TraceCheckUtils]: 33: Hoare triple {102964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {102964#false} assume !(~y~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {102964#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {102964#false} is VALID [2022-04-08 10:12:46,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {102964#false} assume !(~z~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {102964#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {102964#false} is VALID [2022-04-08 10:12:46,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {102964#false} assume !(~x~0 % 4294967296 > 0); {102964#false} is VALID [2022-04-08 10:12:46,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102964#false} is VALID [2022-04-08 10:12:46,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:46,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102971#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102970#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:12:46,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {102969#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:12:46,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {102963#true} assume !(~x~0 % 4294967296 > 0); {102968#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:12:46,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {102963#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {102963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {102963#true} call #t~ret17 := main(); {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102963#true} {102963#true} #94#return; {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {102963#true} assume true; {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {102963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {102963#true} call ULTIMATE.init(); {102963#true} is VALID [2022-04-08 10:12:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:12:46,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512318612] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:46,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:46,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-08 10:12:46,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:46,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914411862] [2022-04-08 10:12:46,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914411862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:46,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:46,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:12:46,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753980682] [2022-04-08 10:12:46,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:46,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:12:46,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:46,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:46,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:46,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:12:46,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:46,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:12:46,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:12:46,565 INFO L87 Difference]: Start difference. First operand 606 states and 817 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:53,871 INFO L93 Difference]: Finished difference Result 1059 states and 1394 transitions. [2022-04-08 10:12:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:12:53,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:12:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 10:12:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-08 10:12:53,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-08 10:12:53,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:53,966 INFO L225 Difference]: With dead ends: 1059 [2022-04-08 10:12:53,966 INFO L226 Difference]: Without dead ends: 897 [2022-04-08 10:12:53,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:12:53,966 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:53,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 67 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:12:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-08 10:12:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 570. [2022-04-08 10:12:57,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:57,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:57,053 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:57,053 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:57,074 INFO L93 Difference]: Finished difference Result 897 states and 1175 transitions. [2022-04-08 10:12:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1175 transitions. [2022-04-08 10:12:57,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:57,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:57,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 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 897 states. [2022-04-08 10:12:57,075 INFO L87 Difference]: Start difference. First operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 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 897 states. [2022-04-08 10:12:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:57,096 INFO L93 Difference]: Finished difference Result 897 states and 1175 transitions. [2022-04-08 10:12:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1175 transitions. [2022-04-08 10:12:57,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:57,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:57,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:57,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 565 states have internal predecessors, (756), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 760 transitions. [2022-04-08 10:12:57,109 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 760 transitions. Word has length 37 [2022-04-08 10:12:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:57,110 INFO L478 AbstractCegarLoop]: Abstraction has 570 states and 760 transitions. [2022-04-08 10:12:57,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:12:57,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 570 states and 760 transitions. [2022-04-08 10:13:01,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 760 edges. 760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 760 transitions. [2022-04-08 10:13:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:13:01,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:01,657 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:01,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:01,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-08 10:13:01,857 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash 972307160, now seen corresponding path program 9 times [2022-04-08 10:13:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1514325841] [2022-04-08 10:13:01,860 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:01,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash 972307160, now seen corresponding path program 10 times [2022-04-08 10:13:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:01,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308927288] [2022-04-08 10:13:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:01,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:02,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {108269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-08 10:13:02,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-08 10:13:02,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-08 10:13:02,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {108254#true} call ULTIMATE.init(); {108269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:02,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {108269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-08 10:13:02,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-08 10:13:02,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-08 10:13:02,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {108254#true} call #t~ret17 := main(); {108254#true} is VALID [2022-04-08 10:13:02,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {108254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108254#true} is VALID [2022-04-08 10:13:02,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {108254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:02,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108260#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:13:02,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {108260#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108261#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:02,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {108261#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108262#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:02,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {108262#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:13:02,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:13:02,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:13:02,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {108263#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108264#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:13:02,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {108264#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108265#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-08 10:13:02,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {108265#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108266#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:13:02,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {108266#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108267#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:13:02,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {108267#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {108268#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {108255#false} assume !(~z~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {108255#false} assume !(~y~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,014 INFO L272 TraceCheckUtils]: 33: Hoare triple {108255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108255#false} is VALID [2022-04-08 10:13:02,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {108255#false} ~cond := #in~cond; {108255#false} is VALID [2022-04-08 10:13:02,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {108255#false} assume 0 == ~cond; {108255#false} is VALID [2022-04-08 10:13:02,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {108255#false} assume !false; {108255#false} is VALID [2022-04-08 10:13:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:13:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308927288] [2022-04-08 10:13:02,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308927288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890379396] [2022-04-08 10:13:02,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:02,024 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:02,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 10:13:02,069 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:02,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:02,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:13:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:02,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:02,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {108254#true} call ULTIMATE.init(); {108254#true} is VALID [2022-04-08 10:13:02,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {108254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-08 10:13:02,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-08 10:13:02,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-08 10:13:02,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {108254#true} call #t~ret17 := main(); {108254#true} is VALID [2022-04-08 10:13:02,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {108254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108254#true} is VALID [2022-04-08 10:13:02,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {108254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:02,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:02,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:02,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:02,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:02,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:02,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {108255#false} assume !(~z~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {108255#false} assume !(~y~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L272 TraceCheckUtils]: 33: Hoare triple {108255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {108255#false} ~cond := #in~cond; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {108255#false} assume 0 == ~cond; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {108255#false} assume !false; {108255#false} is VALID [2022-04-08 10:13:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:13:02,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:02,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {108255#false} assume !false; {108255#false} is VALID [2022-04-08 10:13:02,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {108255#false} assume 0 == ~cond; {108255#false} is VALID [2022-04-08 10:13:02,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {108255#false} ~cond := #in~cond; {108255#false} is VALID [2022-04-08 10:13:02,477 INFO L272 TraceCheckUtils]: 33: Hoare triple {108255#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {108255#false} is VALID [2022-04-08 10:13:02,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {108255#false} assume !(~y~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {108255#false} assume !(~z~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {108255#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {108255#false} is VALID [2022-04-08 10:13:02,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108255#false} is VALID [2022-04-08 10:13:02,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108328#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:02,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:02,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:02,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108306#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108302#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:02,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108298#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:02,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108294#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:02,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {108254#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108259#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:02,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {108254#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108254#true} is VALID [2022-04-08 10:13:02,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {108254#true} call #t~ret17 := main(); {108254#true} is VALID [2022-04-08 10:13:02,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108254#true} {108254#true} #94#return; {108254#true} is VALID [2022-04-08 10:13:02,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {108254#true} assume true; {108254#true} is VALID [2022-04-08 10:13:02,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {108254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {108254#true} is VALID [2022-04-08 10:13:02,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {108254#true} call ULTIMATE.init(); {108254#true} is VALID [2022-04-08 10:13:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:13:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890379396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:02,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:02,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-08 10:13:02,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:02,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1514325841] [2022-04-08 10:13:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1514325841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:02,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:02,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:13:02,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019590985] [2022-04-08 10:13:02,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:13:02,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:02,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:02,512 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-08 10:13:02,512 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:13:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:13:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:13:02,513 INFO L87 Difference]: Start difference. First operand 570 states and 760 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:13,104 INFO L93 Difference]: Finished difference Result 1106 states and 1464 transitions. [2022-04-08 10:13:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:13:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:13:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-08 10:13:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-08 10:13:13,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 111 transitions. [2022-04-08 10:13:13,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:13,249 INFO L225 Difference]: With dead ends: 1106 [2022-04-08 10:13:13,249 INFO L226 Difference]: Without dead ends: 1059 [2022-04-08 10:13:13,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:13:13,250 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 102 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:13,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 85 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:13:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-04-08 10:13:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 610. [2022-04-08 10:13:16,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:16,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1059 states. Second operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:16,830 INFO L74 IsIncluded]: Start isIncluded. First operand 1059 states. Second operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:16,831 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:16,858 INFO L93 Difference]: Finished difference Result 1059 states and 1396 transitions. [2022-04-08 10:13:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1396 transitions. [2022-04-08 10:13:16,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:16,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:16,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 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 1059 states. [2022-04-08 10:13:16,860 INFO L87 Difference]: Start difference. First operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 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 1059 states. [2022-04-08 10:13:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:16,888 INFO L93 Difference]: Finished difference Result 1059 states and 1396 transitions. [2022-04-08 10:13:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1396 transitions. [2022-04-08 10:13:16,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:16,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:16,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:16,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 605 states have (on average 1.3305785123966942) internal successors, (805), 605 states have internal predecessors, (805), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 809 transitions. [2022-04-08 10:13:16,903 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 809 transitions. Word has length 37 [2022-04-08 10:13:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:16,903 INFO L478 AbstractCegarLoop]: Abstraction has 610 states and 809 transitions. [2022-04-08 10:13:16,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:16,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 610 states and 809 transitions. [2022-04-08 10:13:22,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 809 edges. 808 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 809 transitions. [2022-04-08 10:13:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:13:22,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:22,388 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:22,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:22,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:22,589 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1383297369, now seen corresponding path program 21 times [2022-04-08 10:13:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:22,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820194344] [2022-04-08 10:13:22,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:22,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1383297369, now seen corresponding path program 22 times [2022-04-08 10:13:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:22,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224148862] [2022-04-08 10:13:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:22,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {114086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-08 10:13:22,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-08 10:13:22,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-08 10:13:22,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {114066#true} call ULTIMATE.init(); {114086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:22,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {114086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-08 10:13:22,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-08 10:13:22,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-08 10:13:22,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {114066#true} call #t~ret17 := main(); {114066#true} is VALID [2022-04-08 10:13:22,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {114066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114071#(= main_~y~0 0)} is VALID [2022-04-08 10:13:22,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {114071#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114072#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:22,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {114072#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114073#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:22,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {114073#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114074#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:22,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {114074#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:22,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {114075#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114076#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:22,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {114076#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114077#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:22,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {114077#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:22,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:22,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {114078#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {114079#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:22,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {114079#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114080#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:22,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {114080#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114081#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:22,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {114081#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114082#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:22,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {114082#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114083#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:22,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {114083#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114084#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:22,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {114084#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114085#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:22,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {114085#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {114067#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {114067#false} assume !(~x~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {114067#false} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L272 TraceCheckUtils]: 33: Hoare triple {114067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {114067#false} ~cond := #in~cond; {114067#false} is VALID [2022-04-08 10:13:22,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {114067#false} assume 0 == ~cond; {114067#false} is VALID [2022-04-08 10:13:22,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {114067#false} assume !false; {114067#false} is VALID [2022-04-08 10:13:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:13:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224148862] [2022-04-08 10:13:22,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224148862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101781960] [2022-04-08 10:13:22,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:22,817 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:22,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 10:13:22,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:22,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:22,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:13:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:22,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:23,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {114066#true} call ULTIMATE.init(); {114066#true} is VALID [2022-04-08 10:13:23,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {114066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-08 10:13:23,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-08 10:13:23,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-08 10:13:23,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {114066#true} call #t~ret17 := main(); {114066#true} is VALID [2022-04-08 10:13:23,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {114066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114066#true} is VALID [2022-04-08 10:13:23,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114066#true} is VALID [2022-04-08 10:13:23,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:23,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:23,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:23,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:23,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:23,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:23,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:23,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:23,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:23,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:23,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:23,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:23,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:23,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:23,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {114067#false} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:23,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:23,105 INFO L272 TraceCheckUtils]: 33: Hoare triple {114067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {114067#false} is VALID [2022-04-08 10:13:23,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {114067#false} ~cond := #in~cond; {114067#false} is VALID [2022-04-08 10:13:23,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {114067#false} assume 0 == ~cond; {114067#false} is VALID [2022-04-08 10:13:23,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {114067#false} assume !false; {114067#false} is VALID [2022-04-08 10:13:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:13:23,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:23,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {114067#false} assume !false; {114067#false} is VALID [2022-04-08 10:13:23,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {114067#false} assume 0 == ~cond; {114067#false} is VALID [2022-04-08 10:13:23,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {114067#false} ~cond := #in~cond; {114067#false} is VALID [2022-04-08 10:13:23,229 INFO L272 TraceCheckUtils]: 33: Hoare triple {114067#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {114067#false} is VALID [2022-04-08 10:13:23,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {114067#false} assume !(~y~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:23,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {114067#false} assume !(~z~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:23,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {114067#false} is VALID [2022-04-08 10:13:23,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {114156#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114156#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:23,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:23,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:23,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:23,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:23,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:23,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:23,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:23,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114131#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:23,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114127#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:23,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114123#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:23,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114119#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:23,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114115#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:23,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114111#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:23,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {114066#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {114066#true} is VALID [2022-04-08 10:13:23,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {114066#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114066#true} is VALID [2022-04-08 10:13:23,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {114066#true} call #t~ret17 := main(); {114066#true} is VALID [2022-04-08 10:13:23,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114066#true} {114066#true} #94#return; {114066#true} is VALID [2022-04-08 10:13:23,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {114066#true} assume true; {114066#true} is VALID [2022-04-08 10:13:23,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {114066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {114066#true} is VALID [2022-04-08 10:13:23,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {114066#true} call ULTIMATE.init(); {114066#true} is VALID [2022-04-08 10:13:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:13:23,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101781960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:23,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:23,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-08 10:13:23,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:23,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820194344] [2022-04-08 10:13:23,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820194344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:23,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:23,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:13:23,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315602828] [2022-04-08 10:13:23,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:13:23,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:23,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:23,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:23,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:13:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:13:23,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:13:23,260 INFO L87 Difference]: Start difference. First operand 610 states and 809 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:29,373 INFO L93 Difference]: Finished difference Result 720 states and 978 transitions. [2022-04-08 10:13:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:13:29,373 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:13:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 128 transitions. [2022-04-08 10:13:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 128 transitions. [2022-04-08 10:13:29,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 128 transitions. [2022-04-08 10:13:29,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:29,485 INFO L225 Difference]: With dead ends: 720 [2022-04-08 10:13:29,485 INFO L226 Difference]: Without dead ends: 644 [2022-04-08 10:13:29,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=2717, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:13:29,486 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:29,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 111 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:13:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-08 10:13:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 611. [2022-04-08 10:13:33,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:33,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 644 states. Second operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,052 INFO L74 IsIncluded]: Start isIncluded. First operand 644 states. Second operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,052 INFO L87 Difference]: Start difference. First operand 644 states. Second operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:33,063 INFO L93 Difference]: Finished difference Result 644 states and 859 transitions. [2022-04-08 10:13:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 859 transitions. [2022-04-08 10:13:33,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:33,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:33,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 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 644 states. [2022-04-08 10:13:33,065 INFO L87 Difference]: Start difference. First operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 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 644 states. [2022-04-08 10:13:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:33,076 INFO L93 Difference]: Finished difference Result 644 states and 859 transitions. [2022-04-08 10:13:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 859 transitions. [2022-04-08 10:13:33,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:33,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:33,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:33,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 606 states have (on average 1.33003300330033) internal successors, (806), 606 states have internal predecessors, (806), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 810 transitions. [2022-04-08 10:13:33,094 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 810 transitions. Word has length 37 [2022-04-08 10:13:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:33,094 INFO L478 AbstractCegarLoop]: Abstraction has 611 states and 810 transitions. [2022-04-08 10:13:33,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:33,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 611 states and 810 transitions. [2022-04-08 10:13:37,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 810 edges. 810 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 810 transitions. [2022-04-08 10:13:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:13:37,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:37,836 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:37,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:38,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-08 10:13:38,037 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1622108455, now seen corresponding path program 39 times [2022-04-08 10:13:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:38,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [183306369] [2022-04-08 10:13:38,039 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:38,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1622108455, now seen corresponding path program 40 times [2022-04-08 10:13:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:38,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567707871] [2022-04-08 10:13:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:38,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:38,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {118352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-08 10:13:38,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-08 10:13:38,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-08 10:13:38,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {118325#true} call ULTIMATE.init(); {118352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:38,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {118352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-08 10:13:38,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-08 10:13:38,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-08 10:13:38,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {118325#true} call #t~ret17 := main(); {118325#true} is VALID [2022-04-08 10:13:38,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {118325#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118330#(= main_~y~0 0)} is VALID [2022-04-08 10:13:38,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {118330#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118331#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:38,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {118331#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118332#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:38,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {118332#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118333#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:38,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {118333#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118334#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:38,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {118334#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118335#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:38,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {118335#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118336#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:38,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {118336#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118337#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:38,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {118337#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118338#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:38,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {118338#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118339#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:38,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {118339#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118340#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:38,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {118340#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118341#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:38,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {118341#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118342#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:38,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {118342#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118343#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:38,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {118343#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118344#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:38,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {118344#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118345#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:38,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {118345#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118346#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:38,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {118346#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118347#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:38,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {118347#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118348#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:38,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {118348#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118349#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:38,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {118349#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:38,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {118351#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {118351#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {118326#false} assume !(~x~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {118326#false} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,449 INFO L272 TraceCheckUtils]: 33: Hoare triple {118326#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118326#false} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {118326#false} ~cond := #in~cond; {118326#false} is VALID [2022-04-08 10:13:38,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {118326#false} assume 0 == ~cond; {118326#false} is VALID [2022-04-08 10:13:38,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {118326#false} assume !false; {118326#false} is VALID [2022-04-08 10:13:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:38,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567707871] [2022-04-08 10:13:38,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567707871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:38,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281583231] [2022-04-08 10:13:38,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:38,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:38,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:38,451 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:38,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 10:13:38,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:38,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:38,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:13:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:38,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:38,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {118325#true} call ULTIMATE.init(); {118325#true} is VALID [2022-04-08 10:13:38,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {118325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-08 10:13:38,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-08 10:13:38,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-08 10:13:38,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {118325#true} call #t~ret17 := main(); {118325#true} is VALID [2022-04-08 10:13:38,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {118325#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118330#(= main_~y~0 0)} is VALID [2022-04-08 10:13:38,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {118330#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118331#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:38,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {118331#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118332#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:38,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {118332#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118333#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:38,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {118333#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118334#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:38,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {118334#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118335#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:38,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {118335#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118336#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:38,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {118336#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118337#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:38,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {118337#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118338#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:38,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {118338#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118339#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:38,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {118339#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118340#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:38,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {118340#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118341#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:38,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {118341#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118342#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:38,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {118342#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118343#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:38,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {118343#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118344#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:38,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {118344#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118345#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:38,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {118345#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118346#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:38,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {118346#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118347#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:38,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {118347#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118348#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:38,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {118348#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118349#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:38,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {118349#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:38,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:38,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {118350#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {118437#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {118437#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {118326#false} assume !(~x~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {118326#false} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L272 TraceCheckUtils]: 33: Hoare triple {118326#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {118326#false} ~cond := #in~cond; {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {118326#false} assume 0 == ~cond; {118326#false} is VALID [2022-04-08 10:13:38,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {118326#false} assume !false; {118326#false} is VALID [2022-04-08 10:13:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:38,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:39,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {118326#false} assume !false; {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {118326#false} assume 0 == ~cond; {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {118326#false} ~cond := #in~cond; {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L272 TraceCheckUtils]: 33: Hoare triple {118326#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {118326#false} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {118326#false} assume !(~x~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {118326#false} assume !(~y~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:39,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {118489#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {118326#false} is VALID [2022-04-08 10:13:39,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {118493#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {118489#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:39,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {118493#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {118493#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:39,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {118500#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118493#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:39,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {118504#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118500#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:39,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {118508#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118504#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:39,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {118512#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118508#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:39,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {118516#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118512#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:39,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {118520#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118516#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:39,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {118524#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118520#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:39,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {118528#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118524#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:39,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {118532#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118528#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:13:39,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {118536#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118532#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:13:39,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {118540#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118536#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:13:39,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {118544#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118540#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:13:39,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {118548#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118544#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:13:39,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {118552#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118548#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:13:39,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {118556#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118552#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:13:39,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {118560#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118556#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:13:39,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {118564#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118560#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:13:39,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {118568#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118564#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:13:39,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {118572#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118568#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:13:39,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {118576#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {118572#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:39,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {118325#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118576#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:13:39,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {118325#true} call #t~ret17 := main(); {118325#true} is VALID [2022-04-08 10:13:39,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118325#true} {118325#true} #94#return; {118325#true} is VALID [2022-04-08 10:13:39,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {118325#true} assume true; {118325#true} is VALID [2022-04-08 10:13:39,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {118325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {118325#true} is VALID [2022-04-08 10:13:39,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {118325#true} call ULTIMATE.init(); {118325#true} is VALID [2022-04-08 10:13:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:39,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281583231] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:39,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:39,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:13:39,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:39,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [183306369] [2022-04-08 10:13:39,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [183306369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:39,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:39,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:13:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526847629] [2022-04-08 10:13:39,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:39,592 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:13:39,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:39,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:39,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:39,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:13:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:39,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:13:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:13:39,614 INFO L87 Difference]: Start difference. First operand 611 states and 810 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:50,981 INFO L93 Difference]: Finished difference Result 862 states and 1270 transitions. [2022-04-08 10:13:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:13:50,981 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 10:13:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 295 transitions. [2022-04-08 10:13:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 295 transitions. [2022-04-08 10:13:50,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 295 transitions. [2022-04-08 10:13:51,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:51,229 INFO L225 Difference]: With dead ends: 862 [2022-04-08 10:13:51,229 INFO L226 Difference]: Without dead ends: 838 [2022-04-08 10:13:51,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:13:51,230 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 244 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4730 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 4730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:51,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 235 Invalid, 4894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 4730 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 10:13:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-08 10:13:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 639. [2022-04-08 10:13:54,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:54,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 838 states. Second operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,980 INFO L74 IsIncluded]: Start isIncluded. First operand 838 states. Second operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:54,981 INFO L87 Difference]: Start difference. First operand 838 states. Second operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:55,000 INFO L93 Difference]: Finished difference Result 838 states and 1089 transitions. [2022-04-08 10:13:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1089 transitions. [2022-04-08 10:13:55,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:55,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:55,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 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 838 states. [2022-04-08 10:13:55,001 INFO L87 Difference]: Start difference. First operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 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 838 states. [2022-04-08 10:13:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:55,020 INFO L93 Difference]: Finished difference Result 838 states and 1089 transitions. [2022-04-08 10:13:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1089 transitions. [2022-04-08 10:13:55,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:55,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:55,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:55,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 634 states have (on average 1.334384858044164) internal successors, (846), 634 states have internal predecessors, (846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 850 transitions. [2022-04-08 10:13:55,037 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 850 transitions. Word has length 37 [2022-04-08 10:13:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:55,037 INFO L478 AbstractCegarLoop]: Abstraction has 639 states and 850 transitions. [2022-04-08 10:13:55,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:55,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 639 states and 850 transitions. [2022-04-08 10:13:58,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 850 edges. 850 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 850 transitions. [2022-04-08 10:13:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:13:58,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:58,375 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:58,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:58,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-08 10:13:58,576 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2000192251, now seen corresponding path program 23 times [2022-04-08 10:13:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:58,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866711176] [2022-04-08 10:13:58,578 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:58,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2000192251, now seen corresponding path program 24 times [2022-04-08 10:13:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:58,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606571413] [2022-04-08 10:13:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:58,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {123341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-08 10:13:58,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-08 10:13:58,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-08 10:13:58,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {123319#true} call ULTIMATE.init(); {123341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:58,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {123341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-08 10:13:58,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-08 10:13:58,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-08 10:13:58,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {123319#true} call #t~ret17 := main(); {123319#true} is VALID [2022-04-08 10:13:58,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {123319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123324#(= main_~y~0 0)} is VALID [2022-04-08 10:13:58,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {123324#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:58,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {123325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:58,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {123326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:58,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {123327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:58,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {123328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123329#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:58,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {123329#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123330#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:58,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {123330#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:58,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:58,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {123331#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {123332#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:13:58,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {123332#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123333#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:58,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {123333#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123334#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:58,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {123334#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123335#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:58,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {123335#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123336#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:58,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {123336#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123337#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:58,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {123337#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123338#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:58,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {123338#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123339#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:13:58,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {123339#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {123339#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:13:58,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {123339#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123338#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:13:58,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {123338#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123337#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:13:58,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {123337#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123336#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:13:58,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {123336#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123335#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:13:58,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {123335#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123334#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:13:58,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {123334#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123333#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:13:58,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {123333#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:58,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:58,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:13:58,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {123340#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:58,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {123320#false} assume !(~y~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:58,870 INFO L272 TraceCheckUtils]: 34: Hoare triple {123320#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123320#false} is VALID [2022-04-08 10:13:58,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {123320#false} ~cond := #in~cond; {123320#false} is VALID [2022-04-08 10:13:58,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {123320#false} assume 0 == ~cond; {123320#false} is VALID [2022-04-08 10:13:58,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {123320#false} assume !false; {123320#false} is VALID [2022-04-08 10:13:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:58,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606571413] [2022-04-08 10:13:58,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606571413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:58,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357604847] [2022-04-08 10:13:58,871 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:58,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:58,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:58,872 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:58,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-08 10:13:58,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:13:58,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:58,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:13:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:58,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:59,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {123319#true} call ULTIMATE.init(); {123319#true} is VALID [2022-04-08 10:13:59,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {123319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-08 10:13:59,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-08 10:13:59,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-08 10:13:59,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {123319#true} call #t~ret17 := main(); {123319#true} is VALID [2022-04-08 10:13:59,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {123319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123319#true} is VALID [2022-04-08 10:13:59,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {123319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:59,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:59,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:59,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:59,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:59,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:59,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:59,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:59,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:59,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:59,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:59,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {123320#false} assume !(~z~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:59,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {123320#false} assume !(~y~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:59,230 INFO L272 TraceCheckUtils]: 34: Hoare triple {123320#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123320#false} is VALID [2022-04-08 10:13:59,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {123320#false} ~cond := #in~cond; {123320#false} is VALID [2022-04-08 10:13:59,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {123320#false} assume 0 == ~cond; {123320#false} is VALID [2022-04-08 10:13:59,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {123320#false} assume !false; {123320#false} is VALID [2022-04-08 10:13:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:13:59,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:59,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {123320#false} assume !false; {123320#false} is VALID [2022-04-08 10:13:59,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {123320#false} assume 0 == ~cond; {123320#false} is VALID [2022-04-08 10:13:59,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {123320#false} ~cond := #in~cond; {123320#false} is VALID [2022-04-08 10:13:59,385 INFO L272 TraceCheckUtils]: 34: Hoare triple {123320#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {123320#false} is VALID [2022-04-08 10:13:59,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {123320#false} assume !(~y~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:59,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {123320#false} assume !(~z~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:59,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {123320#false} is VALID [2022-04-08 10:13:59,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {123415#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123415#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:13:59,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:59,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:59,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:59,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:59,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:59,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123387#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123383#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:13:59,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123379#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:13:59,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123375#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:13:59,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123371#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:13:59,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123367#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:13:59,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {123319#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {123363#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:13:59,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {123319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123319#true} is VALID [2022-04-08 10:13:59,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {123319#true} call #t~ret17 := main(); {123319#true} is VALID [2022-04-08 10:13:59,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123319#true} {123319#true} #94#return; {123319#true} is VALID [2022-04-08 10:13:59,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {123319#true} assume true; {123319#true} is VALID [2022-04-08 10:13:59,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {123319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123319#true} is VALID [2022-04-08 10:13:59,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {123319#true} call ULTIMATE.init(); {123319#true} is VALID [2022-04-08 10:13:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:13:59,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357604847] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:59,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:59,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-08 10:13:59,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:59,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866711176] [2022-04-08 10:13:59,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866711176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:59,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:59,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:13:59,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047595470] [2022-04-08 10:13:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:59,399 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:13:59,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:59,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:13:59,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:59,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:13:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:13:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:13:59,428 INFO L87 Difference]: Start difference. First operand 639 states and 850 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:16,119 INFO L93 Difference]: Finished difference Result 1104 states and 1567 transitions. [2022-04-08 10:14:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-04-08 10:14:16,120 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:14:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 384 transitions. [2022-04-08 10:14:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 384 transitions. [2022-04-08 10:14:16,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 384 transitions. [2022-04-08 10:14:16,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:16,477 INFO L225 Difference]: With dead ends: 1104 [2022-04-08 10:14:16,477 INFO L226 Difference]: Without dead ends: 1024 [2022-04-08 10:14:16,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=588, Invalid=11184, Unknown=0, NotChecked=0, Total=11772 [2022-04-08 10:14:16,478 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 153 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3594 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 3594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:16,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 128 Invalid, 3997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 3594 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 10:14:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-04-08 10:14:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 691. [2022-04-08 10:14:20,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:20,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1024 states. Second operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:20,998 INFO L74 IsIncluded]: Start isIncluded. First operand 1024 states. Second operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:20,999 INFO L87 Difference]: Start difference. First operand 1024 states. Second operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:21,025 INFO L93 Difference]: Finished difference Result 1024 states and 1265 transitions. [2022-04-08 10:14:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1265 transitions. [2022-04-08 10:14:21,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:21,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:21,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 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 1024 states. [2022-04-08 10:14:21,027 INFO L87 Difference]: Start difference. First operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 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 1024 states. [2022-04-08 10:14:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:21,054 INFO L93 Difference]: Finished difference Result 1024 states and 1265 transitions. [2022-04-08 10:14:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1265 transitions. [2022-04-08 10:14:21,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:21,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:21,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:21,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 686 states have (on average 1.3396501457725947) internal successors, (919), 686 states have internal predecessors, (919), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 923 transitions. [2022-04-08 10:14:21,072 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 923 transitions. Word has length 38 [2022-04-08 10:14:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:21,073 INFO L478 AbstractCegarLoop]: Abstraction has 691 states and 923 transitions. [2022-04-08 10:14:21,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:21,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 923 transitions. [2022-04-08 10:14:24,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 923 transitions. [2022-04-08 10:14:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:14:24,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:24,744 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:24,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:24,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:24,944 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:24,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1001175461, now seen corresponding path program 13 times [2022-04-08 10:14:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:24,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [730033371] [2022-04-08 10:14:24,947 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:24,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1001175461, now seen corresponding path program 14 times [2022-04-08 10:14:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:24,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38045785] [2022-04-08 10:14:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {129394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-08 10:14:25,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-08 10:14:25,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-08 10:14:25,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {129377#true} call ULTIMATE.init(); {129394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:25,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {129394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-08 10:14:25,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-08 10:14:25,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-08 10:14:25,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {129377#true} call #t~ret17 := main(); {129377#true} is VALID [2022-04-08 10:14:25,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {129377#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129382#(= main_~y~0 0)} is VALID [2022-04-08 10:14:25,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {129382#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129383#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:25,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {129383#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129384#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:25,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {129384#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129385#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:25,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {129385#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129386#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:25,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {129386#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129387#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:25,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {129387#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129388#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:25,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {129388#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129389#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:25,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {129389#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129390#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:25,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {129390#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:25,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:25,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {129392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:25,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {129392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129393#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:14:25,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {129393#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {129378#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {129378#false} assume !(~x~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {129378#false} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,117 INFO L272 TraceCheckUtils]: 34: Hoare triple {129378#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129378#false} is VALID [2022-04-08 10:14:25,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {129378#false} ~cond := #in~cond; {129378#false} is VALID [2022-04-08 10:14:25,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {129378#false} assume 0 == ~cond; {129378#false} is VALID [2022-04-08 10:14:25,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {129378#false} assume !false; {129378#false} is VALID [2022-04-08 10:14:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-08 10:14:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:25,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38045785] [2022-04-08 10:14:25,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38045785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:25,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727044470] [2022-04-08 10:14:25,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:14:25,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:25,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:25,119 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:25,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-08 10:14:25,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:14:25,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:25,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:14:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:25,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:25,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {129377#true} call ULTIMATE.init(); {129377#true} is VALID [2022-04-08 10:14:25,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {129377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-08 10:14:25,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-08 10:14:25,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-08 10:14:25,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {129377#true} call #t~ret17 := main(); {129377#true} is VALID [2022-04-08 10:14:25,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {129377#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129382#(= main_~y~0 0)} is VALID [2022-04-08 10:14:25,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {129382#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129383#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:25,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {129383#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129384#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:25,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {129384#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129385#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:25,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {129385#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129386#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:25,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {129386#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129387#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:25,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {129387#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129388#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:25,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {129388#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129389#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:25,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {129389#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129390#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:25,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {129390#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:25,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:25,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {129391#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {129392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:25,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {129392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129449#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {129449#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {129378#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {129378#false} assume !(~x~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {129378#false} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L272 TraceCheckUtils]: 34: Hoare triple {129378#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {129378#false} ~cond := #in~cond; {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {129378#false} assume 0 == ~cond; {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {129378#false} assume !false; {129378#false} is VALID [2022-04-08 10:14:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-08 10:14:25,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {129378#false} assume !false; {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {129378#false} assume 0 == ~cond; {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {129378#false} ~cond := #in~cond; {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L272 TraceCheckUtils]: 34: Hoare triple {129378#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {129378#false} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {129378#false} assume !(~x~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {129378#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {129378#false} assume !(~y~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {129378#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {129378#false} is VALID [2022-04-08 10:14:25,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {129567#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {129378#false} is VALID [2022-04-08 10:14:25,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {129571#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {129567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:25,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {129571#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:25,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:25,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {129582#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:25,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {129586#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129582#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:25,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {129590#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129586#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:25,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {129594#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129590#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:25,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {129598#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129594#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:25,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {129602#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129598#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:25,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {129606#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129602#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:25,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {129610#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129606#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:14:25,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {129614#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {129610#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:25,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {129377#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {129614#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:14:25,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {129377#true} call #t~ret17 := main(); {129377#true} is VALID [2022-04-08 10:14:25,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129377#true} {129377#true} #94#return; {129377#true} is VALID [2022-04-08 10:14:25,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {129377#true} assume true; {129377#true} is VALID [2022-04-08 10:14:25,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {129377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {129377#true} is VALID [2022-04-08 10:14:25,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {129377#true} call ULTIMATE.init(); {129377#true} is VALID [2022-04-08 10:14:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-08 10:14:25,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727044470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:25,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:25,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:14:25,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:25,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [730033371] [2022-04-08 10:14:25,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [730033371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:25,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:25,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:14:25,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844462966] [2022-04-08 10:14:25,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:25,730 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:14:25,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:25,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:25,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:25,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:14:25,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:25,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:14:25,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:14:25,748 INFO L87 Difference]: Start difference. First operand 691 states and 923 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:32,624 INFO L93 Difference]: Finished difference Result 808 states and 1060 transitions. [2022-04-08 10:14:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:14:32,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:14:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2022-04-08 10:14:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2022-04-08 10:14:32,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 134 transitions. [2022-04-08 10:14:32,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:32,746 INFO L225 Difference]: With dead ends: 808 [2022-04-08 10:14:32,747 INFO L226 Difference]: Without dead ends: 788 [2022-04-08 10:14:32,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:14:32,747 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 117 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:32,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 120 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:14:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-04-08 10:14:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 691. [2022-04-08 10:14:37,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:37,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 788 states. Second operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,240 INFO L74 IsIncluded]: Start isIncluded. First operand 788 states. Second operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,240 INFO L87 Difference]: Start difference. First operand 788 states. Second operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:37,257 INFO L93 Difference]: Finished difference Result 788 states and 1039 transitions. [2022-04-08 10:14:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1039 transitions. [2022-04-08 10:14:37,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:37,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:37,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 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 788 states. [2022-04-08 10:14:37,259 INFO L87 Difference]: Start difference. First operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 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 788 states. [2022-04-08 10:14:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:37,276 INFO L93 Difference]: Finished difference Result 788 states and 1039 transitions. [2022-04-08 10:14:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1039 transitions. [2022-04-08 10:14:37,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:37,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:37,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:37,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 686 states have (on average 1.338192419825073) internal successors, (918), 686 states have internal predecessors, (918), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 922 transitions. [2022-04-08 10:14:37,298 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 922 transitions. Word has length 38 [2022-04-08 10:14:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:37,298 INFO L478 AbstractCegarLoop]: Abstraction has 691 states and 922 transitions. [2022-04-08 10:14:37,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:37,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 922 transitions. [2022-04-08 10:14:40,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 922 edges. 922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 922 transitions. [2022-04-08 10:14:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:14:40,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:40,778 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:40,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:40,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-08 10:14:40,979 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -14392650, now seen corresponding path program 41 times [2022-04-08 10:14:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:40,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191668875] [2022-04-08 10:14:40,981 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:40,981 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash -14392650, now seen corresponding path program 42 times [2022-04-08 10:14:40,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:40,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741487588] [2022-04-08 10:14:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:41,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {134263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-08 10:14:41,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-08 10:14:41,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-08 10:14:41,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {134235#true} call ULTIMATE.init(); {134263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:41,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {134263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-08 10:14:41,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-08 10:14:41,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-08 10:14:41,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {134235#true} call #t~ret17 := main(); {134235#true} is VALID [2022-04-08 10:14:41,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {134235#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134240#(= main_~y~0 0)} is VALID [2022-04-08 10:14:41,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {134240#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134241#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:41,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {134241#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134242#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:41,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {134242#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134243#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:41,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {134243#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134244#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:41,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {134244#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134245#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:41,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {134245#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134246#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:41,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {134246#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134247#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:41,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {134247#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134248#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:41,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {134248#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134249#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {134249#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134250#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:41,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {134250#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134251#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:41,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {134251#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134252#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:41,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {134252#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134253#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:41,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {134253#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134254#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:41,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {134254#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134255#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:41,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {134255#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134256#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:14:41,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {134256#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134257#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:14:41,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {134257#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134258#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:14:41,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {134258#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134259#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:14:41,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {134259#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134260#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:14:41,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {134260#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:41,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:41,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {134262#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-08 10:14:41,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {134262#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:41,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:41,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {134236#false} assume !(~x~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:41,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {134236#false} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:41,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:41,370 INFO L272 TraceCheckUtils]: 34: Hoare triple {134236#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {134236#false} is VALID [2022-04-08 10:14:41,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {134236#false} ~cond := #in~cond; {134236#false} is VALID [2022-04-08 10:14:41,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {134236#false} assume 0 == ~cond; {134236#false} is VALID [2022-04-08 10:14:41,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {134236#false} assume !false; {134236#false} is VALID [2022-04-08 10:14:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:14:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:41,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741487588] [2022-04-08 10:14:41,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741487588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:41,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931616166] [2022-04-08 10:14:41,371 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:14:41,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:41,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:41,372 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:41,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-08 10:14:41,904 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 10:14:41,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:41,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:14:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:41,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:42,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {134235#true} call ULTIMATE.init(); {134235#true} is VALID [2022-04-08 10:14:42,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {134235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-08 10:14:42,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-08 10:14:42,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-08 10:14:42,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {134235#true} call #t~ret17 := main(); {134235#true} is VALID [2022-04-08 10:14:42,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {134235#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134240#(= main_~y~0 0)} is VALID [2022-04-08 10:14:42,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {134240#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134241#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:42,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {134241#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134242#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:42,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {134242#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134243#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:42,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {134243#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134244#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:42,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {134244#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134245#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:42,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {134245#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134246#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:42,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {134246#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134247#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:42,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {134247#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134248#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:42,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {134248#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134249#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:42,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {134249#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134250#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:42,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {134250#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134251#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:14:42,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {134251#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134252#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:14:42,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {134252#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134253#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:14:42,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {134253#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134254#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:14:42,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {134254#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134255#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:14:42,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {134255#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134256#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:14:42,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {134256#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134257#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:14:42,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {134257#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134258#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:14:42,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {134258#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134259#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:14:42,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {134259#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134260#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:14:42,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {134260#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:42,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:14:42,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {134261#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:14:42,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:14:42,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:14:42,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:14:42,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {134351#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:42,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:42,244 INFO L272 TraceCheckUtils]: 34: Hoare triple {134236#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {134236#false} is VALID [2022-04-08 10:14:42,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {134236#false} ~cond := #in~cond; {134236#false} is VALID [2022-04-08 10:14:42,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {134236#false} assume 0 == ~cond; {134236#false} is VALID [2022-04-08 10:14:42,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {134236#false} assume !false; {134236#false} is VALID [2022-04-08 10:14:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:14:42,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:43,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {134236#false} assume !false; {134236#false} is VALID [2022-04-08 10:14:43,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {134236#false} assume 0 == ~cond; {134236#false} is VALID [2022-04-08 10:14:43,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {134236#false} ~cond := #in~cond; {134236#false} is VALID [2022-04-08 10:14:43,065 INFO L272 TraceCheckUtils]: 34: Hoare triple {134236#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {134236#false} is VALID [2022-04-08 10:14:43,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {134236#false} assume !(~y~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:43,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {134236#false} is VALID [2022-04-08 10:14:43,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:43,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:43,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {134394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:43,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {134407#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {134394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:43,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {134407#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {134407#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:43,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {134414#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134407#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:43,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {134418#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134414#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:43,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {134422#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134418#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:43,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {134426#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134422#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:43,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {134430#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134426#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:43,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {134434#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134430#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:43,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {134438#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134434#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:14:43,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {134442#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134438#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:43,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {134446#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134442#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:14:43,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {134450#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134446#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:14:43,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {134454#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134450#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:14:43,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {134458#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134454#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:14:43,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {134462#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134458#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:14:43,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {134466#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134462#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:14:43,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {134470#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134466#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:14:43,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {134474#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134470#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:14:43,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {134478#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134474#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:14:43,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {134482#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134478#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:14:43,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {134486#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134482#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:14:43,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {134490#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134486#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:43,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {134494#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {134490#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:14:43,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {134235#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {134494#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:14:43,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {134235#true} call #t~ret17 := main(); {134235#true} is VALID [2022-04-08 10:14:43,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134235#true} {134235#true} #94#return; {134235#true} is VALID [2022-04-08 10:14:43,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {134235#true} assume true; {134235#true} is VALID [2022-04-08 10:14:43,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {134235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {134235#true} is VALID [2022-04-08 10:14:43,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {134235#true} call ULTIMATE.init(); {134235#true} is VALID [2022-04-08 10:14:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:14:43,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931616166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:43,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:43,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:14:43,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:43,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191668875] [2022-04-08 10:14:43,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191668875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:43,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:43,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:14:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546124696] [2022-04-08 10:14:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:14:43,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:43,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:43,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:43,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:14:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:14:43,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:14:43,104 INFO L87 Difference]: Start difference. First operand 691 states and 922 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:56,158 INFO L93 Difference]: Finished difference Result 953 states and 1403 transitions. [2022-04-08 10:14:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:14:56,158 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 10:14:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 308 transitions. [2022-04-08 10:14:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:14:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 308 transitions. [2022-04-08 10:14:56,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 308 transitions. [2022-04-08 10:14:56,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:56,423 INFO L225 Difference]: With dead ends: 953 [2022-04-08 10:14:56,423 INFO L226 Difference]: Without dead ends: 929 [2022-04-08 10:14:56,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:14:56,423 INFO L913 BasicCegarLoop]: 129 mSDtfsCounter, 259 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5197 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 5197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:56,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 246 Invalid, 5370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 5197 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 10:14:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-04-08 10:15:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 721. [2022-04-08 10:15:01,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:01,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 929 states. Second operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:01,135 INFO L74 IsIncluded]: Start isIncluded. First operand 929 states. Second operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:01,135 INFO L87 Difference]: Start difference. First operand 929 states. Second operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:01,157 INFO L93 Difference]: Finished difference Result 929 states and 1215 transitions. [2022-04-08 10:15:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1215 transitions. [2022-04-08 10:15:01,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:01,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:01,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 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 929 states. [2022-04-08 10:15:01,159 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 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 929 states. [2022-04-08 10:15:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:01,181 INFO L93 Difference]: Finished difference Result 929 states and 1215 transitions. [2022-04-08 10:15:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1215 transitions. [2022-04-08 10:15:01,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:01,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:01,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:01,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.3421787709497206) internal successors, (961), 716 states have internal predecessors, (961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 965 transitions. [2022-04-08 10:15:01,201 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 965 transitions. Word has length 38 [2022-04-08 10:15:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:01,201 INFO L478 AbstractCegarLoop]: Abstraction has 721 states and 965 transitions. [2022-04-08 10:15:01,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:01,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 965 transitions. [2022-04-08 10:15:04,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 965 edges. 965 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 965 transitions. [2022-04-08 10:15:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:15:04,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:04,845 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:04,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:05,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:05,046 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash 932823321, now seen corresponding path program 15 times [2022-04-08 10:15:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:05,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019326397] [2022-04-08 10:15:05,048 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:05,048 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 932823321, now seen corresponding path program 16 times [2022-04-08 10:15:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:05,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508774849] [2022-04-08 10:15:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:05,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {139784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-08 10:15:05,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-08 10:15:05,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-08 10:15:05,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {139767#true} call ULTIMATE.init(); {139784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:05,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {139784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-08 10:15:05,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-08 10:15:05,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-08 10:15:05,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {139767#true} call #t~ret17 := main(); {139767#true} is VALID [2022-04-08 10:15:05,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {139767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139772#(= main_~y~0 0)} is VALID [2022-04-08 10:15:05,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {139772#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:05,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {139773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:05,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {139774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:05,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {139775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:05,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {139776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:05,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {139777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139778#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:05,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {139778#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139779#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:05,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {139779#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:05,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:05,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {139781#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:05,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {139781#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139782#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:05,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {139782#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139783#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:05,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {139783#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {139768#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {139768#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {139768#false} assume !(~x~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {139768#false} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,244 INFO L272 TraceCheckUtils]: 35: Hoare triple {139768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139768#false} is VALID [2022-04-08 10:15:05,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {139768#false} ~cond := #in~cond; {139768#false} is VALID [2022-04-08 10:15:05,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {139768#false} assume 0 == ~cond; {139768#false} is VALID [2022-04-08 10:15:05,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {139768#false} assume !false; {139768#false} is VALID [2022-04-08 10:15:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:15:05,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:05,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508774849] [2022-04-08 10:15:05,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508774849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:05,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505633] [2022-04-08 10:15:05,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:15:05,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:05,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:05,246 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:05,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-08 10:15:05,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:15:05,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:05,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:15:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:05,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:05,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {139767#true} call ULTIMATE.init(); {139767#true} is VALID [2022-04-08 10:15:05,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {139767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-08 10:15:05,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-08 10:15:05,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-08 10:15:05,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {139767#true} call #t~ret17 := main(); {139767#true} is VALID [2022-04-08 10:15:05,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {139767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139772#(= main_~y~0 0)} is VALID [2022-04-08 10:15:05,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {139772#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:05,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {139773#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:05,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {139774#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:05,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {139775#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:05,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {139776#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:05,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {139777#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139778#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:05,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {139778#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139779#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:05,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {139779#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:05,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:05,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {139780#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {139781#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:05,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {139781#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139782#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:05,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {139782#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139839#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {139839#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {139768#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {139768#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {139768#false} assume !(~x~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {139768#false} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L272 TraceCheckUtils]: 35: Hoare triple {139768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {139768#false} ~cond := #in~cond; {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {139768#false} assume 0 == ~cond; {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {139768#false} assume !false; {139768#false} is VALID [2022-04-08 10:15:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:15:05,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {139768#false} assume !false; {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {139768#false} assume 0 == ~cond; {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {139768#false} ~cond := #in~cond; {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L272 TraceCheckUtils]: 35: Hoare triple {139768#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {139768#false} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {139768#false} assume !(~x~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {139768#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {139768#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {139768#false} is VALID [2022-04-08 10:15:05,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {139768#false} assume !(~y~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {139768#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {139768#false} is VALID [2022-04-08 10:15:05,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {139963#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {139768#false} is VALID [2022-04-08 10:15:05,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {139967#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139963#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:05,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {139971#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139967#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:05,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {139971#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:05,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:05,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {139982#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139975#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:05,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {139986#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139982#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:05,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {139990#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139986#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:05,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {139994#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139990#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:15:05,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {139998#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139994#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:15:05,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {140002#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {139998#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:15:05,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {140006#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140002#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:15:05,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {140010#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140006#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:05,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {139767#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140010#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:05,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {139767#true} call #t~ret17 := main(); {139767#true} is VALID [2022-04-08 10:15:05,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139767#true} {139767#true} #94#return; {139767#true} is VALID [2022-04-08 10:15:05,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {139767#true} assume true; {139767#true} is VALID [2022-04-08 10:15:05,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {139767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {139767#true} is VALID [2022-04-08 10:15:05,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {139767#true} call ULTIMATE.init(); {139767#true} is VALID [2022-04-08 10:15:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:15:05,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:05,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:05,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:15:05,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:05,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019326397] [2022-04-08 10:15:05,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019326397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:05,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:05,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:15:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288936534] [2022-04-08 10:15:05,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:05,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:15:05,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:05,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:05,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:05,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:15:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:15:05,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:15:05,835 INFO L87 Difference]: Start difference. First operand 721 states and 965 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:12,690 INFO L93 Difference]: Finished difference Result 819 states and 1081 transitions. [2022-04-08 10:15:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:15:12,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:15:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 126 transitions. [2022-04-08 10:15:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 126 transitions. [2022-04-08 10:15:12,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 126 transitions. [2022-04-08 10:15:12,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:12,808 INFO L225 Difference]: With dead ends: 819 [2022-04-08 10:15:12,808 INFO L226 Difference]: Without dead ends: 798 [2022-04-08 10:15:12,808 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:15:12,808 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 105 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:12,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 111 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:15:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-04-08 10:15:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 721. [2022-04-08 10:15:17,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:17,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 798 states. Second operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:17,591 INFO L74 IsIncluded]: Start isIncluded. First operand 798 states. Second operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:17,592 INFO L87 Difference]: Start difference. First operand 798 states. Second operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:17,609 INFO L93 Difference]: Finished difference Result 798 states and 1059 transitions. [2022-04-08 10:15:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1059 transitions. [2022-04-08 10:15:17,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:17,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:17,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 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 798 states. [2022-04-08 10:15:17,611 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 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 798 states. [2022-04-08 10:15:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:17,628 INFO L93 Difference]: Finished difference Result 798 states and 1059 transitions. [2022-04-08 10:15:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1059 transitions. [2022-04-08 10:15:17,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:17,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:17,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:17,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.3407821229050279) internal successors, (960), 716 states have internal predecessors, (960), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 964 transitions. [2022-04-08 10:15:17,653 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 964 transitions. Word has length 39 [2022-04-08 10:15:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:17,653 INFO L478 AbstractCegarLoop]: Abstraction has 721 states and 964 transitions. [2022-04-08 10:15:17,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:17,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 964 transitions. [2022-04-08 10:15:21,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 964 edges. 964 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 964 transitions. [2022-04-08 10:15:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:15:21,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:21,405 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:21,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:21,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-08 10:15:21,606 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash -159271655, now seen corresponding path program 25 times [2022-04-08 10:15:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:21,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046568492] [2022-04-08 10:15:21,614 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:21,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -159271655, now seen corresponding path program 26 times [2022-04-08 10:15:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:21,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750285889] [2022-04-08 10:15:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:21,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {144758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-08 10:15:21,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-08 10:15:21,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-08 10:15:21,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {144737#true} call ULTIMATE.init(); {144758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:21,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {144758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-08 10:15:21,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-08 10:15:21,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-08 10:15:21,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {144737#true} call #t~ret17 := main(); {144737#true} is VALID [2022-04-08 10:15:21,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {144737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144742#(= main_~y~0 0)} is VALID [2022-04-08 10:15:21,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {144742#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:21,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {144743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:21,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {144744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:21,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {144745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:21,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {144746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:21,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {144747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:21,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {144748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:21,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {144749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:21,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:21,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {144750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {144751#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:21,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {144751#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144752#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:15:21,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {144752#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144753#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:15:21,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {144753#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144754#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:15:21,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {144754#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144755#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:15:21,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {144755#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144756#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:15:21,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {144756#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144757#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {144757#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {144738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:21,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {144738#false} assume !(~x~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:21,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {144738#false} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:21,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:21,911 INFO L272 TraceCheckUtils]: 35: Hoare triple {144738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144738#false} is VALID [2022-04-08 10:15:21,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {144738#false} ~cond := #in~cond; {144738#false} is VALID [2022-04-08 10:15:21,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {144738#false} assume 0 == ~cond; {144738#false} is VALID [2022-04-08 10:15:21,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {144738#false} assume !false; {144738#false} is VALID [2022-04-08 10:15:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:15:21,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:21,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750285889] [2022-04-08 10:15:21,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750285889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:21,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907773233] [2022-04-08 10:15:21,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:15:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:21,913 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:21,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-08 10:15:21,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:15:21,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:21,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:15:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:21,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:22,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {144737#true} call ULTIMATE.init(); {144737#true} is VALID [2022-04-08 10:15:22,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {144737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-08 10:15:22,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-08 10:15:22,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-08 10:15:22,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {144737#true} call #t~ret17 := main(); {144737#true} is VALID [2022-04-08 10:15:22,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {144737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144737#true} is VALID [2022-04-08 10:15:22,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-08 10:15:22,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-08 10:15:22,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:22,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {144738#false} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:22,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:22,205 INFO L272 TraceCheckUtils]: 35: Hoare triple {144738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144738#false} is VALID [2022-04-08 10:15:22,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {144738#false} ~cond := #in~cond; {144738#false} is VALID [2022-04-08 10:15:22,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {144738#false} assume 0 == ~cond; {144738#false} is VALID [2022-04-08 10:15:22,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {144738#false} assume !false; {144738#false} is VALID [2022-04-08 10:15:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:15:22,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:22,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {144738#false} assume !false; {144738#false} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {144738#false} assume 0 == ~cond; {144738#false} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {144738#false} ~cond := #in~cond; {144738#false} is VALID [2022-04-08 10:15:22,316 INFO L272 TraceCheckUtils]: 35: Hoare triple {144738#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144738#false} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {144738#false} assume !(~y~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {144738#false} assume !(~z~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {144738#false} is VALID [2022-04-08 10:15:22,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {144831#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144831#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:15:22,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144806#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:15:22,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144802#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:15:22,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144798#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:15:22,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144794#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:15:22,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144790#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:15:22,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144786#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:15:22,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {144737#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {144737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {144737#true} call #t~ret17 := main(); {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144737#true} {144737#true} #94#return; {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {144737#true} assume true; {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {144737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {144737#true} call ULTIMATE.init(); {144737#true} is VALID [2022-04-08 10:15:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:15:22,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907773233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:22,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:22,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 26 [2022-04-08 10:15:22,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046568492] [2022-04-08 10:15:22,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046568492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:22,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:22,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:15:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621580410] [2022-04-08 10:15:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:22,328 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:15:22,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:22,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:22,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:22,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:15:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:15:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:15:22,348 INFO L87 Difference]: Start difference. First operand 721 states and 964 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:29,665 INFO L93 Difference]: Finished difference Result 882 states and 1190 transitions. [2022-04-08 10:15:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:15:29,666 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:15:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 148 transitions. [2022-04-08 10:15:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 148 transitions. [2022-04-08 10:15:29,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 148 transitions. [2022-04-08 10:15:29,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:29,799 INFO L225 Difference]: With dead ends: 882 [2022-04-08 10:15:29,799 INFO L226 Difference]: Without dead ends: 759 [2022-04-08 10:15:29,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=3259, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:15:29,800 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 99 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:29,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 101 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:15:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-04-08 10:15:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 722. [2022-04-08 10:15:34,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:34,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 759 states. Second operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:34,545 INFO L74 IsIncluded]: Start isIncluded. First operand 759 states. Second operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:34,546 INFO L87 Difference]: Start difference. First operand 759 states. Second operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:34,560 INFO L93 Difference]: Finished difference Result 759 states and 1017 transitions. [2022-04-08 10:15:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1017 transitions. [2022-04-08 10:15:34,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:34,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:34,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 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 759 states. [2022-04-08 10:15:34,561 INFO L87 Difference]: Start difference. First operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 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 759 states. [2022-04-08 10:15:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:34,576 INFO L93 Difference]: Finished difference Result 759 states and 1017 transitions. [2022-04-08 10:15:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1017 transitions. [2022-04-08 10:15:34,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:34,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:34,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:34,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 717 states have (on average 1.3361227336122734) internal successors, (958), 717 states have internal predecessors, (958), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 962 transitions. [2022-04-08 10:15:34,596 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 962 transitions. Word has length 39 [2022-04-08 10:15:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:34,596 INFO L478 AbstractCegarLoop]: Abstraction has 722 states and 962 transitions. [2022-04-08 10:15:34,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:34,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 722 states and 962 transitions. [2022-04-08 10:15:40,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 962 edges. 961 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 962 transitions. [2022-04-08 10:15:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:15:40,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:40,738 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:40,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:40,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-08 10:15:40,938 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1714810247, now seen corresponding path program 43 times [2022-04-08 10:15:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:40,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724887825] [2022-04-08 10:15:40,941 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:40,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1714810247, now seen corresponding path program 44 times [2022-04-08 10:15:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:40,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584226944] [2022-04-08 10:15:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:41,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {149822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-08 10:15:41,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-08 10:15:41,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-08 10:15:41,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {149793#true} call ULTIMATE.init(); {149822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:41,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {149822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-08 10:15:41,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-08 10:15:41,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-08 10:15:41,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {149793#true} call #t~ret17 := main(); {149793#true} is VALID [2022-04-08 10:15:41,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {149793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {149798#(= main_~y~0 0)} is VALID [2022-04-08 10:15:41,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {149798#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:41,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {149799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:41,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {149800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:41,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {149801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:41,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {149802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:41,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {149803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:41,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {149804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:41,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {149805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:41,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {149806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:41,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {149807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:41,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {149808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:41,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {149809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149810#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:41,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {149810#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149811#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:41,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {149811#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149812#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:15:41,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {149812#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149813#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:15:41,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {149813#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149814#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:15:41,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {149814#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149815#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:15:41,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {149815#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149816#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:15:41,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {149816#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149817#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:15:41,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {149817#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149818#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:15:41,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {149818#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149819#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:15:41,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {149819#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:15:41,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:15:41,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {149821#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:41,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {149821#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:41,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:41,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {149794#false} assume !(~x~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:41,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {149794#false} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:41,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:41,389 INFO L272 TraceCheckUtils]: 35: Hoare triple {149794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {149794#false} is VALID [2022-04-08 10:15:41,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {149794#false} ~cond := #in~cond; {149794#false} is VALID [2022-04-08 10:15:41,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {149794#false} assume 0 == ~cond; {149794#false} is VALID [2022-04-08 10:15:41,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {149794#false} assume !false; {149794#false} is VALID [2022-04-08 10:15:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:15:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:41,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584226944] [2022-04-08 10:15:41,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584226944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:41,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473853447] [2022-04-08 10:15:41,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:15:41,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:41,391 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:41,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-08 10:15:41,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:15:41,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:41,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:15:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:41,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:41,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {149793#true} call ULTIMATE.init(); {149793#true} is VALID [2022-04-08 10:15:41,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {149793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-08 10:15:41,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-08 10:15:41,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-08 10:15:41,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {149793#true} call #t~ret17 := main(); {149793#true} is VALID [2022-04-08 10:15:41,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {149793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {149798#(= main_~y~0 0)} is VALID [2022-04-08 10:15:41,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {149798#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:41,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {149799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:41,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {149800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:41,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {149801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:41,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {149802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:41,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {149803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:41,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {149804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:41,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {149805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:41,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {149806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:41,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {149807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:41,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {149808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:41,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {149809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149810#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:41,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {149810#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149811#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:41,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {149811#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149812#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:15:41,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {149812#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149813#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:15:41,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {149813#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149814#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:15:41,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {149814#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149815#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:15:41,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {149815#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149816#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:15:41,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {149816#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149817#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:15:41,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {149817#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149818#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:15:41,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {149818#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149819#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:15:41,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {149819#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:15:41,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:15:41,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {149820#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:15:41,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:15:41,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~y~0 % 4294967296 > 0); {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:15:41,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~x~0 % 4294967296 > 0); {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:15:41,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {149913#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:41,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:41,789 INFO L272 TraceCheckUtils]: 35: Hoare triple {149794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {149794#false} is VALID [2022-04-08 10:15:41,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {149794#false} ~cond := #in~cond; {149794#false} is VALID [2022-04-08 10:15:41,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {149794#false} assume 0 == ~cond; {149794#false} is VALID [2022-04-08 10:15:41,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {149794#false} assume !false; {149794#false} is VALID [2022-04-08 10:15:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:15:41,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:42,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {149794#false} assume !false; {149794#false} is VALID [2022-04-08 10:15:42,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {149794#false} assume 0 == ~cond; {149794#false} is VALID [2022-04-08 10:15:42,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {149794#false} ~cond := #in~cond; {149794#false} is VALID [2022-04-08 10:15:42,685 INFO L272 TraceCheckUtils]: 35: Hoare triple {149794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {149794#false} is VALID [2022-04-08 10:15:42,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {149794#false} assume !(~y~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:42,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {149794#false} is VALID [2022-04-08 10:15:42,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:42,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:42,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {149956#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:42,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {149969#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {149956#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:42,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {149969#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {149969#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:42,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {149976#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149969#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:42,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {149980#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149976#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:15:42,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {149984#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149980#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:15:42,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {149988#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149984#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:15:42,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {149992#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149988#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:15:42,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {149996#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149992#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:42,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {150000#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {149996#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:42,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {150004#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150000#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:42,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {150008#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150004#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:15:42,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {150012#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150008#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:15:42,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {150016#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150012#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:15:42,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {150020#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150016#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:15:42,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {150024#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150020#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:15:42,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {150028#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150024#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:15:42,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {150032#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150028#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:15:42,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {150036#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150032#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:15:42,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {150040#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150036#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:15:42,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {150044#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150040#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:15:42,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {150048#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150044#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:15:42,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {150052#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150048#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:42,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {150056#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150052#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:15:42,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {150060#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {150056#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:15:42,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {149793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150060#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:15:42,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {149793#true} call #t~ret17 := main(); {149793#true} is VALID [2022-04-08 10:15:42,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149793#true} {149793#true} #94#return; {149793#true} is VALID [2022-04-08 10:15:42,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {149793#true} assume true; {149793#true} is VALID [2022-04-08 10:15:42,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {149793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {149793#true} is VALID [2022-04-08 10:15:42,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {149793#true} call ULTIMATE.init(); {149793#true} is VALID [2022-04-08 10:15:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:15:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473853447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:42,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:42,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-08 10:15:42,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724887825] [2022-04-08 10:15:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724887825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:42,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:42,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:15:42,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512462764] [2022-04-08 10:15:42,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:42,703 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:15:42,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:42,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:42,724 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-08 10:15:42,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:15:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:15:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:15:42,725 INFO L87 Difference]: Start difference. First operand 722 states and 962 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:56,674 INFO L93 Difference]: Finished difference Result 993 states and 1461 transitions. [2022-04-08 10:15:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:15:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 10:15:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 321 transitions. [2022-04-08 10:15:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:15:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 321 transitions. [2022-04-08 10:15:56,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 321 transitions. [2022-04-08 10:15:56,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:56,975 INFO L225 Difference]: With dead ends: 993 [2022-04-08 10:15:56,975 INFO L226 Difference]: Without dead ends: 969 [2022-04-08 10:15:56,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:15:56,975 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 272 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5686 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 5868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 5686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:56,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 257 Invalid, 5868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 5686 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-08 10:15:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-08 10:16:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 752. [2022-04-08 10:16:01,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:01,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,918 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,919 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:01,943 INFO L93 Difference]: Finished difference Result 969 states and 1266 transitions. [2022-04-08 10:16:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1266 transitions. [2022-04-08 10:16:01,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:01,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:01,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 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 969 states. [2022-04-08 10:16:01,945 INFO L87 Difference]: Start difference. First operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 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 969 states. [2022-04-08 10:16:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:01,969 INFO L93 Difference]: Finished difference Result 969 states and 1266 transitions. [2022-04-08 10:16:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1266 transitions. [2022-04-08 10:16:01,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:01,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:01,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:01,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 747 states have (on average 1.3400267737617135) internal successors, (1001), 747 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1005 transitions. [2022-04-08 10:16:01,991 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1005 transitions. Word has length 39 [2022-04-08 10:16:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:01,991 INFO L478 AbstractCegarLoop]: Abstraction has 752 states and 1005 transitions. [2022-04-08 10:16:01,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:01,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 752 states and 1005 transitions. [2022-04-08 10:16:06,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1005 edges. 1005 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1005 transitions. [2022-04-08 10:16:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:16:06,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:06,334 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:06,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:06,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:06,535 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1576064171, now seen corresponding path program 27 times [2022-04-08 10:16:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:06,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045193938] [2022-04-08 10:16:06,537 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:06,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1576064171, now seen corresponding path program 28 times [2022-04-08 10:16:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:06,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100836110] [2022-04-08 10:16:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:06,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:06,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {155579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-08 10:16:06,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-08 10:16:06,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-08 10:16:06,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {155557#true} call ULTIMATE.init(); {155579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:06,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {155579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-08 10:16:06,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-08 10:16:06,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-08 10:16:06,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {155557#true} call #t~ret17 := main(); {155557#true} is VALID [2022-04-08 10:16:06,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {155557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155562#(= main_~y~0 0)} is VALID [2022-04-08 10:16:06,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {155562#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155563#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:06,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {155563#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155564#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:06,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {155564#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155565#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:06,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {155565#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155566#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:06,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {155566#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155567#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:06,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {155567#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155568#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:06,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {155568#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155569#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:06,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {155569#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:06,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:06,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {155570#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {155571#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:16:06,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {155571#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155572#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:16:06,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {155572#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155573#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:16:06,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {155573#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155574#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:16:06,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {155574#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155575#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:16:06,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {155575#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155576#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:16:06,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {155576#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155577#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {155577#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155578#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {155578#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {155558#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {155558#false} assume !(~x~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {155558#false} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L272 TraceCheckUtils]: 36: Hoare triple {155558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {155558#false} ~cond := #in~cond; {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {155558#false} assume 0 == ~cond; {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {155558#false} assume !false; {155558#false} is VALID [2022-04-08 10:16:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:16:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:06,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100836110] [2022-04-08 10:16:06,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100836110] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:06,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980852029] [2022-04-08 10:16:06,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:16:06,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:06,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:06,794 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-08 10:16:06,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:16:06,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:06,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:16:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:06,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:07,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {155557#true} call ULTIMATE.init(); {155557#true} is VALID [2022-04-08 10:16:07,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {155557#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-08 10:16:07,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-08 10:16:07,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-08 10:16:07,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {155557#true} call #t~ret17 := main(); {155557#true} is VALID [2022-04-08 10:16:07,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {155557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155557#true} is VALID [2022-04-08 10:16:07,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155557#true} is VALID [2022-04-08 10:16:07,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:07,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:07,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:07,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:07,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:07,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:07,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:07,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:07,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:07,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:07,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:07,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {155558#false} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:07,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:07,129 INFO L272 TraceCheckUtils]: 36: Hoare triple {155558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {155558#false} is VALID [2022-04-08 10:16:07,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {155558#false} ~cond := #in~cond; {155558#false} is VALID [2022-04-08 10:16:07,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {155558#false} assume 0 == ~cond; {155558#false} is VALID [2022-04-08 10:16:07,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {155558#false} assume !false; {155558#false} is VALID [2022-04-08 10:16:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:16:07,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:07,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {155558#false} assume !false; {155558#false} is VALID [2022-04-08 10:16:07,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {155558#false} assume 0 == ~cond; {155558#false} is VALID [2022-04-08 10:16:07,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {155558#false} ~cond := #in~cond; {155558#false} is VALID [2022-04-08 10:16:07,256 INFO L272 TraceCheckUtils]: 36: Hoare triple {155558#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {155558#false} is VALID [2022-04-08 10:16:07,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {155558#false} assume !(~y~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:07,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {155558#false} assume !(~z~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:07,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {155558#false} is VALID [2022-04-08 10:16:07,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {155656#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155656#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:16:07,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:07,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:07,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:07,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:07,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:07,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155628#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155624#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:16:07,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155620#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:16:07,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155616#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:16:07,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155612#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:16:07,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155608#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:16:07,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155604#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:16:07,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {155557#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155557#true} is VALID [2022-04-08 10:16:07,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {155557#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155557#true} is VALID [2022-04-08 10:16:07,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {155557#true} call #t~ret17 := main(); {155557#true} is VALID [2022-04-08 10:16:07,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155557#true} {155557#true} #94#return; {155557#true} is VALID [2022-04-08 10:16:07,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {155557#true} assume true; {155557#true} is VALID [2022-04-08 10:16:07,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {155557#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {155557#true} is VALID [2022-04-08 10:16:07,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {155557#true} call ULTIMATE.init(); {155557#true} is VALID [2022-04-08 10:16:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:16:07,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980852029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:07,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:07,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-08 10:16:07,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:07,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045193938] [2022-04-08 10:16:07,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045193938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:07,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:07,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:16:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548819382] [2022-04-08 10:16:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:07,270 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:07,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:07,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:07,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:07,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:16:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:07,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:16:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:16:07,290 INFO L87 Difference]: Start difference. First operand 752 states and 1005 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:15,525 INFO L93 Difference]: Finished difference Result 876 states and 1196 transitions. [2022-04-08 10:16:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 10:16:15,526 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 146 transitions. [2022-04-08 10:16:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 146 transitions. [2022-04-08 10:16:15,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 146 transitions. [2022-04-08 10:16:15,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:15,662 INFO L225 Difference]: With dead ends: 876 [2022-04-08 10:16:15,662 INFO L226 Difference]: Without dead ends: 790 [2022-04-08 10:16:15,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=4096, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:16:15,663 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:15,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 121 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:16:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-04-08 10:16:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 753. [2022-04-08 10:16:20,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:20,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 790 states. Second operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,604 INFO L74 IsIncluded]: Start isIncluded. First operand 790 states. Second operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,604 INFO L87 Difference]: Start difference. First operand 790 states. Second operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:20,622 INFO L93 Difference]: Finished difference Result 790 states and 1061 transitions. [2022-04-08 10:16:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1061 transitions. [2022-04-08 10:16:20,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:20,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:20,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 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 790 states. [2022-04-08 10:16:20,623 INFO L87 Difference]: Start difference. First operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 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 790 states. [2022-04-08 10:16:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:20,641 INFO L93 Difference]: Finished difference Result 790 states and 1061 transitions. [2022-04-08 10:16:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1061 transitions. [2022-04-08 10:16:20,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:20,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:20,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:20,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 748 states have (on average 1.339572192513369) internal successors, (1002), 748 states have internal predecessors, (1002), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1006 transitions. [2022-04-08 10:16:20,667 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1006 transitions. Word has length 40 [2022-04-08 10:16:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:20,667 INFO L478 AbstractCegarLoop]: Abstraction has 753 states and 1006 transitions. [2022-04-08 10:16:20,667 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:20,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 753 states and 1006 transitions. [2022-04-08 10:16:24,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1006 edges. 1006 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1006 transitions. [2022-04-08 10:16:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:16:24,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:24,518 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:24,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:24,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:24,718 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1170033867, now seen corresponding path program 17 times [2022-04-08 10:16:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:24,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168601614] [2022-04-08 10:16:24,720 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:24,721 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1170033867, now seen corresponding path program 18 times [2022-04-08 10:16:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:24,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128105735] [2022-04-08 10:16:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:24,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:24,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {160761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-08 10:16:24,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-08 10:16:24,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-08 10:16:24,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {160743#true} call ULTIMATE.init(); {160761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:24,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {160761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-08 10:16:24,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-08 10:16:24,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-08 10:16:24,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {160743#true} call #t~ret17 := main(); {160743#true} is VALID [2022-04-08 10:16:24,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {160743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160748#(= main_~y~0 0)} is VALID [2022-04-08 10:16:24,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {160748#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:24,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {160749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:24,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {160750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:24,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {160751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:24,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {160752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:24,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {160753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:24,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {160754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:24,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {160755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:24,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {160756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:24,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {160757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:24,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:24,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {160758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {160759#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:16:24,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {160759#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160760#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:16:24,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {160760#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:24,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {160744#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {160744#false} assume !(~x~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {160744#false} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {160744#false} is VALID [2022-04-08 10:16:24,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:24,921 INFO L272 TraceCheckUtils]: 36: Hoare triple {160744#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160744#false} is VALID [2022-04-08 10:16:24,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {160744#false} ~cond := #in~cond; {160744#false} is VALID [2022-04-08 10:16:24,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {160744#false} assume 0 == ~cond; {160744#false} is VALID [2022-04-08 10:16:24,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {160744#false} assume !false; {160744#false} is VALID [2022-04-08 10:16:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-08 10:16:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:24,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128105735] [2022-04-08 10:16:24,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128105735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:24,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538778682] [2022-04-08 10:16:24,921 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:16:24,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:24,922 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:24,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-08 10:16:25,031 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:16:25,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:25,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:16:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:25,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:25,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {160743#true} call ULTIMATE.init(); {160743#true} is VALID [2022-04-08 10:16:25,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {160743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-08 10:16:25,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-08 10:16:25,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-08 10:16:25,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {160743#true} call #t~ret17 := main(); {160743#true} is VALID [2022-04-08 10:16:25,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {160743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160743#true} is VALID [2022-04-08 10:16:25,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {160743#true} assume !(~x~0 % 4294967296 > 0); {160743#true} is VALID [2022-04-08 10:16:25,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {160743#true} ~z~0 := ~y~0; {160816#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:16:25,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {160816#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160820#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:16:25,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {160820#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {160824#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:16:25,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {160824#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160828#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:16:25,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {160828#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {160744#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {160744#false} assume !(~x~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {160744#false} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {160744#false} is VALID [2022-04-08 10:16:25,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,157 INFO L272 TraceCheckUtils]: 36: Hoare triple {160744#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160744#false} is VALID [2022-04-08 10:16:25,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {160744#false} ~cond := #in~cond; {160744#false} is VALID [2022-04-08 10:16:25,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {160744#false} assume 0 == ~cond; {160744#false} is VALID [2022-04-08 10:16:25,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {160744#false} assume !false; {160744#false} is VALID [2022-04-08 10:16:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-08 10:16:25,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:25,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {160744#false} assume !false; {160744#false} is VALID [2022-04-08 10:16:25,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {160744#false} assume 0 == ~cond; {160744#false} is VALID [2022-04-08 10:16:25,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {160744#false} ~cond := #in~cond; {160744#false} is VALID [2022-04-08 10:16:25,274 INFO L272 TraceCheckUtils]: 36: Hoare triple {160744#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {160744#false} assume !(~z~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {160744#false} assume !(~x~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {160744#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {160744#false} assume !(~y~0 % 4294967296 > 0); {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {160744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {160828#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160744#false} is VALID [2022-04-08 10:16:25,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {160824#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160828#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:16:25,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {160946#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {160824#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {160950#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160946#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {160743#true} ~z~0 := ~y~0; {160950#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {160743#true} assume !(~x~0 % 4294967296 > 0); {160743#true} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {160743#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {160743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {160743#true} call #t~ret17 := main(); {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160743#true} {160743#true} #94#return; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {160743#true} assume true; {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {160743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {160743#true} call ULTIMATE.init(); {160743#true} is VALID [2022-04-08 10:16:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-08 10:16:25,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538778682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:25,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:25,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2022-04-08 10:16:25,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:25,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1168601614] [2022-04-08 10:16:25,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1168601614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:25,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:25,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:16:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258625962] [2022-04-08 10:16:25,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:25,280 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:25,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:25,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:25,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:25,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:16:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:16:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:16:25,299 INFO L87 Difference]: Start difference. First operand 753 states and 1006 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:32,827 INFO L93 Difference]: Finished difference Result 879 states and 1154 transitions. [2022-04-08 10:16:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:16:32,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 145 transitions. [2022-04-08 10:16:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 145 transitions. [2022-04-08 10:16:32,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 145 transitions. [2022-04-08 10:16:32,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:32,967 INFO L225 Difference]: With dead ends: 879 [2022-04-08 10:16:32,968 INFO L226 Difference]: Without dead ends: 858 [2022-04-08 10:16:32,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:16:32,968 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 132 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:32,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 126 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:16:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-04-08 10:16:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 753. [2022-04-08 10:16:37,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:37,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 858 states. Second operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:37,912 INFO L74 IsIncluded]: Start isIncluded. First operand 858 states. Second operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:37,912 INFO L87 Difference]: Start difference. First operand 858 states. Second operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:37,932 INFO L93 Difference]: Finished difference Result 858 states and 1132 transitions. [2022-04-08 10:16:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1132 transitions. [2022-04-08 10:16:37,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:37,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:37,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 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 858 states. [2022-04-08 10:16:37,933 INFO L87 Difference]: Start difference. First operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 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 858 states. [2022-04-08 10:16:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:37,952 INFO L93 Difference]: Finished difference Result 858 states and 1132 transitions. [2022-04-08 10:16:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1132 transitions. [2022-04-08 10:16:37,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:37,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:37,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:37,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 748 states have internal predecessors, (1001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1005 transitions. [2022-04-08 10:16:37,975 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1005 transitions. Word has length 40 [2022-04-08 10:16:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:37,975 INFO L478 AbstractCegarLoop]: Abstraction has 753 states and 1005 transitions. [2022-04-08 10:16:37,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:37,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 753 states and 1005 transitions. [2022-04-08 10:16:42,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1005 edges. 1005 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1005 transitions. [2022-04-08 10:16:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:16:42,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:42,580 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:42,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:42,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:42,780 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1406819094, now seen corresponding path program 45 times [2022-04-08 10:16:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:42,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083187091] [2022-04-08 10:16:42,783 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:42,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1406819094, now seen corresponding path program 46 times [2022-04-08 10:16:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:42,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712735204] [2022-04-08 10:16:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:43,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {166045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-08 10:16:43,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-08 10:16:43,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-08 10:16:43,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {166015#true} call ULTIMATE.init(); {166045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:43,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {166045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-08 10:16:43,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-08 10:16:43,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-08 10:16:43,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {166015#true} call #t~ret17 := main(); {166015#true} is VALID [2022-04-08 10:16:43,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {166015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166020#(= main_~y~0 0)} is VALID [2022-04-08 10:16:43,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {166020#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:43,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {166021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:43,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {166022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:43,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {166023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:43,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {166024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:43,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {166025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:43,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {166026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:43,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {166027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:43,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {166028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:43,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {166029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:43,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {166030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166031#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:43,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {166031#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166032#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:43,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {166032#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166033#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:43,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {166033#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166034#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:43,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {166034#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166035#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:43,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {166035#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166036#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:43,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {166036#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166037#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:43,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {166037#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166038#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:43,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {166038#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166039#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:43,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {166039#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166040#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:43,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {166040#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166041#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:43,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {166041#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166042#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:43,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {166042#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:43,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:43,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {166044#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-08 10:16:43,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {166044#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {166016#false} assume !(~x~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {166016#false} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,233 INFO L272 TraceCheckUtils]: 36: Hoare triple {166016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166016#false} is VALID [2022-04-08 10:16:43,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {166016#false} ~cond := #in~cond; {166016#false} is VALID [2022-04-08 10:16:43,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {166016#false} assume 0 == ~cond; {166016#false} is VALID [2022-04-08 10:16:43,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {166016#false} assume !false; {166016#false} is VALID [2022-04-08 10:16:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:43,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712735204] [2022-04-08 10:16:43,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712735204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628966978] [2022-04-08 10:16:43,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:16:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:43,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:43,234 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:43,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-08 10:16:43,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:16:43,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:43,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 10:16:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:43,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:43,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {166015#true} call ULTIMATE.init(); {166015#true} is VALID [2022-04-08 10:16:43,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {166015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-08 10:16:43,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-08 10:16:43,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-08 10:16:43,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {166015#true} call #t~ret17 := main(); {166015#true} is VALID [2022-04-08 10:16:43,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {166015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166020#(= main_~y~0 0)} is VALID [2022-04-08 10:16:43,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {166020#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:43,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {166021#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:43,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {166022#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:43,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {166023#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:43,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {166024#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:43,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {166025#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:43,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {166026#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:43,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {166027#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:43,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {166028#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:43,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {166029#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:43,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {166030#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166031#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:43,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {166031#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166032#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:43,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {166032#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166033#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:43,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {166033#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166034#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:43,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {166034#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166035#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:43,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {166035#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166036#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:43,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {166036#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166037#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:43,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {166037#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166038#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:43,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {166038#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166039#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:43,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {166039#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166040#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:43,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {166040#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166041#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:43,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {166041#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166042#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:43,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {166042#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:43,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:43,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {166043#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {166139#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {166139#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {166016#false} assume !(~x~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {166016#false} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L272 TraceCheckUtils]: 36: Hoare triple {166016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {166016#false} ~cond := #in~cond; {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {166016#false} assume 0 == ~cond; {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {166016#false} assume !false; {166016#false} is VALID [2022-04-08 10:16:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:43,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:44,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {166016#false} assume !false; {166016#false} is VALID [2022-04-08 10:16:44,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {166016#false} assume 0 == ~cond; {166016#false} is VALID [2022-04-08 10:16:44,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {166016#false} ~cond := #in~cond; {166016#false} is VALID [2022-04-08 10:16:44,586 INFO L272 TraceCheckUtils]: 36: Hoare triple {166016#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166016#false} is VALID [2022-04-08 10:16:44,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:44,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {166016#false} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:44,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {166016#false} assume !(~x~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:44,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {166016#false} assume !(~y~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:44,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {166191#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {166016#false} is VALID [2022-04-08 10:16:44,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {166195#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {166191#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:16:44,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {166195#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {166195#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:44,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {166202#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166195#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:44,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {166206#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166202#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:16:44,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {166210#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166206#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:16:44,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {166214#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166210#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:16:44,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {166218#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166214#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:16:44,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {166222#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166218#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:44,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {166226#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166222#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:16:44,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {166230#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166226#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:44,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {166234#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166230#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:16:44,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {166238#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166234#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:16:44,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {166242#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166238#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:16:44,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {166246#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166242#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:16:44,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {166250#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166246#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:16:44,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {166254#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166250#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:16:44,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {166258#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166254#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:16:44,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {166262#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166258#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:16:44,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {166266#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166262#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:16:44,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {166270#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166266#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:16:44,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {166274#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166270#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:16:44,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {166278#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166274#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:44,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {166282#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166278#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:16:44,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {166286#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166282#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:16:44,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {166290#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166286#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:16:44,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {166015#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166290#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:44,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {166015#true} call #t~ret17 := main(); {166015#true} is VALID [2022-04-08 10:16:44,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166015#true} {166015#true} #94#return; {166015#true} is VALID [2022-04-08 10:16:44,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {166015#true} assume true; {166015#true} is VALID [2022-04-08 10:16:44,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {166015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166015#true} is VALID [2022-04-08 10:16:44,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {166015#true} call ULTIMATE.init(); {166015#true} is VALID [2022-04-08 10:16:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:44,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628966978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:44,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:44,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-08 10:16:44,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:44,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083187091] [2022-04-08 10:16:44,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083187091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:44,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:44,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:16:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454777160] [2022-04-08 10:16:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:44,604 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:44,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:44,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:44,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:44,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:16:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:44,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:16:44,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:16:44,626 INFO L87 Difference]: Start difference. First operand 753 states and 1005 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:59,533 INFO L93 Difference]: Finished difference Result 1033 states and 1522 transitions. [2022-04-08 10:16:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:16:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 10:16:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 334 transitions. [2022-04-08 10:16:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:16:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 334 transitions. [2022-04-08 10:16:59,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 334 transitions. [2022-04-08 10:16:59,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:59,844 INFO L225 Difference]: With dead ends: 1033 [2022-04-08 10:16:59,844 INFO L226 Difference]: Without dead ends: 1009 [2022-04-08 10:16:59,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 10:16:59,845 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 287 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6197 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 6197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:59,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 268 Invalid, 6388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 6197 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 10:16:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-04-08 10:17:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 783. [2022-04-08 10:17:05,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:05,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1009 states. Second operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:05,033 INFO L74 IsIncluded]: Start isIncluded. First operand 1009 states. Second operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:05,033 INFO L87 Difference]: Start difference. First operand 1009 states. Second operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:05,060 INFO L93 Difference]: Finished difference Result 1009 states and 1320 transitions. [2022-04-08 10:17:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1320 transitions. [2022-04-08 10:17:05,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:05,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:05,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 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 1009 states. [2022-04-08 10:17:05,066 INFO L87 Difference]: Start difference. First operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 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 1009 states. [2022-04-08 10:17:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:05,091 INFO L93 Difference]: Finished difference Result 1009 states and 1320 transitions. [2022-04-08 10:17:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1320 transitions. [2022-04-08 10:17:05,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:05,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:05,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:05,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 778 states have (on average 1.3419023136246786) internal successors, (1044), 778 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1048 transitions. [2022-04-08 10:17:05,117 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1048 transitions. Word has length 40 [2022-04-08 10:17:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:05,117 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 1048 transitions. [2022-04-08 10:17:05,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:05,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 783 states and 1048 transitions. [2022-04-08 10:17:11,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1048 edges. 1047 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1048 transitions. [2022-04-08 10:17:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:17:11,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:11,365 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:11,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-08 10:17:11,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-08 10:17:11,565 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:17:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:17:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 13 times [2022-04-08 10:17:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:11,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [788367975] [2022-04-08 10:17:11,567 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:17:11,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:17:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 14 times [2022-04-08 10:17:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:17:11,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635108319] [2022-04-08 10:17:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:17:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:17:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:17:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:12,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {172031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-08 10:17:12,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-08 10:17:12,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-08 10:17:12,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {172011#true} call ULTIMATE.init(); {172031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:17:12,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {172031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-08 10:17:12,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-08 10:17:12,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-08 10:17:12,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {172011#true} call #t~ret17 := main(); {172011#true} is VALID [2022-04-08 10:17:12,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {172011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:17:12,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:12,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:17:12,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172019#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {172019#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172020#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-08 10:17:12,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {172020#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {172021#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:17:12,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {172021#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {172022#(and (<= main_~z~0 4) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:17:12,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {172022#(and (<= main_~z~0 4) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-08 10:17:12,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-08 10:17:12,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !(~x~0 % 4294967296 > 0); {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:12,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-08 10:17:12,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-08 10:17:12,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:12,039 INFO L272 TraceCheckUtils]: 37: Hoare triple {172028#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172029#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:17:12,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {172029#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172030#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:17:12,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {172030#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {172012#false} is VALID [2022-04-08 10:17:12,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {172012#false} assume !false; {172012#false} is VALID [2022-04-08 10:17:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:17:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:17:12,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635108319] [2022-04-08 10:17:12,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635108319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:17:12,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33117727] [2022-04-08 10:17:12,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:17:12,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:12,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:17:12,041 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:17:12,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-08 10:17:12,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:17:12,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:17:12,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-08 10:17:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:12,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:17:28,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {172011#true} call ULTIMATE.init(); {172011#true} is VALID [2022-04-08 10:17:28,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {172011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-08 10:17:28,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-08 10:17:28,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-08 10:17:28,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {172011#true} call #t~ret17 := main(); {172011#true} is VALID [2022-04-08 10:17:28,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {172011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:17:28,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {172016#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:28,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {172017#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:17:28,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {172018#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172059#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {172059#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172063#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:17:28,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {172063#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {172067#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:17:28,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {172067#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:17:28,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:17:28,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-08 10:17:28,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:17:28,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:17:28,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:17:28,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {172087#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172094#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 1) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))))} is VALID [2022-04-08 10:17:28,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {172094#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 1) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172098#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 2) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {172098#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 2) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172102#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {172102#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~z~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {172106#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172113#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:28,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {172113#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172117#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:28,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {172117#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172121#(and (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {172121#(and (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~z~0 4) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:17:28,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:17:28,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {172071#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:17:28,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {172075#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-08 10:17:28,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {172079#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:17:28,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {172083#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {172026#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {172025#(and (<= main_~z~0 1) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} is VALID [2022-04-08 10:17:28,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {172024#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:17:28,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {172023#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:28,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} is VALID [2022-04-08 10:17:28,166 INFO L272 TraceCheckUtils]: 37: Hoare triple {172027#(and (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~z~0 4))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:17:28,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172165#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:17:28,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {172165#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {172012#false} is VALID [2022-04-08 10:17:28,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {172012#false} assume !false; {172012#false} is VALID [2022-04-08 10:17:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:17:28,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:17:29,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {172012#false} assume !false; {172012#false} is VALID [2022-04-08 10:17:29,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {172165#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {172012#false} is VALID [2022-04-08 10:17:29,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172165#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:17:29,977 INFO L272 TraceCheckUtils]: 37: Hoare triple {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172161#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:17:29,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:29,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:29,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:17:29,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:17:29,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:17:29,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:17:29,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172200#(= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:17:29,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172196#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:17:29,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172192#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:17:29,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {172188#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:17:29,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {172181#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:29,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {172223#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:17:29,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {172227#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172223#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:17:29,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {172231#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172227#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:17:29,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {172231#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:17:29,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:29,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {172242#(or (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172235#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:29,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {172246#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172242#(or (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:29,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {172250#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172246#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:29,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {172250#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:29,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:29,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {172261#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172254#(or (= (mod (+ main_~z~0 4) 4294967296) (mod main_~n~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:29,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {172265#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172261#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-08 10:17:29,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {172269#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172265#(or (= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:17:29,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {172269#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:17:30,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {172219#(or (= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:17:30,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:17:30,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {172283#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172276#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:17:30,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {172287#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172283#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:17:30,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {172291#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172287#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:17:30,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {172295#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172291#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:17:30,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {172011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172295#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:17:30,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {172011#true} call #t~ret17 := main(); {172011#true} is VALID [2022-04-08 10:17:30,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172011#true} {172011#true} #94#return; {172011#true} is VALID [2022-04-08 10:17:30,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {172011#true} assume true; {172011#true} is VALID [2022-04-08 10:17:30,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {172011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172011#true} is VALID [2022-04-08 10:17:30,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {172011#true} call ULTIMATE.init(); {172011#true} is VALID [2022-04-08 10:17:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:17:30,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33117727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:17:30,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:17:30,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 26] total 57 [2022-04-08 10:17:30,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:17:30,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [788367975] [2022-04-08 10:17:30,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [788367975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:17:30,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:17:30,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:17:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317348020] [2022-04-08 10:17:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:17:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:17:30,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:17:30,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:30,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:30,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:17:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:17:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 10:17:30,048 INFO L87 Difference]: Start difference. First operand 783 states and 1048 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:41,055 INFO L93 Difference]: Finished difference Result 1002 states and 1271 transitions. [2022-04-08 10:17:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:17:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:17:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-08 10:17:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-08 10:17:41,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-08 10:17:41,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:41,155 INFO L225 Difference]: With dead ends: 1002 [2022-04-08 10:17:41,155 INFO L226 Difference]: Without dead ends: 987 [2022-04-08 10:17:41,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=574, Invalid=4538, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 10:17:41,156 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:41,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 93 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:17:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-08 10:17:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 793. [2022-04-08 10:17:46,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:46,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:46,626 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:46,626 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:46,651 INFO L93 Difference]: Finished difference Result 987 states and 1255 transitions. [2022-04-08 10:17:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1255 transitions. [2022-04-08 10:17:46,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:46,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:46,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 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 987 states. [2022-04-08 10:17:46,653 INFO L87 Difference]: Start difference. First operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 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 987 states. [2022-04-08 10:17:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:46,678 INFO L93 Difference]: Finished difference Result 987 states and 1255 transitions. [2022-04-08 10:17:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1255 transitions. [2022-04-08 10:17:46,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:46,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:46,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:46,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 788 states have (on average 1.3413705583756346) internal successors, (1057), 788 states have internal predecessors, (1057), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1061 transitions. [2022-04-08 10:17:46,703 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1061 transitions. Word has length 41 [2022-04-08 10:17:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:46,703 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1061 transitions. [2022-04-08 10:17:46,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:46,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 793 states and 1061 transitions. [2022-04-08 10:17:51,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1061 edges. 1061 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1061 transitions. [2022-04-08 10:17:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:17:51,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:51,020 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:51,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-08 10:17:51,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-08 10:17:51,221 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:17:51,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:17:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1107564487, now seen corresponding path program 11 times [2022-04-08 10:17:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:51,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1439300985] [2022-04-08 10:17:51,223 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:17:51,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:17:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1107564487, now seen corresponding path program 12 times [2022-04-08 10:17:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:17:51,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963655711] [2022-04-08 10:17:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:17:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:17:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:17:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:51,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {177927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-08 10:17:51,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-08 10:17:51,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-08 10:17:51,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {177910#true} call ULTIMATE.init(); {177927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:17:51,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {177927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-08 10:17:51,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-08 10:17:51,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-08 10:17:51,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {177910#true} call #t~ret17 := main(); {177910#true} is VALID [2022-04-08 10:17:51,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {177910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177910#true} is VALID [2022-04-08 10:17:51,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {177910#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:51,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177916#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:17:51,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {177916#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177917#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:51,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {177917#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177918#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:51,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {177918#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177919#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:51,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {177919#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:17:51,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:17:51,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:17:51,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {177920#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177921#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:17:51,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {177921#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177922#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-08 10:17:51,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {177922#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177923#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-08 10:17:51,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {177923#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177924#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:17:51,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {177924#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177925#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:17:51,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {177925#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:17:51,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {177926#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:51,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {177911#false} assume !(~z~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {177911#false} assume !(~y~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L272 TraceCheckUtils]: 37: Hoare triple {177911#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {177911#false} ~cond := #in~cond; {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {177911#false} assume 0 == ~cond; {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {177911#false} assume !false; {177911#false} is VALID [2022-04-08 10:17:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:17:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:17:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963655711] [2022-04-08 10:17:51,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963655711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:17:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066901301] [2022-04-08 10:17:51,408 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:17:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:17:51,409 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:17:51,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-08 10:17:51,482 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:17:51,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:17:51,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:17:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:51,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:17:51,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {177910#true} call ULTIMATE.init(); {177910#true} is VALID [2022-04-08 10:17:51,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {177910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-08 10:17:51,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-08 10:17:51,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-08 10:17:51,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {177910#true} call #t~ret17 := main(); {177910#true} is VALID [2022-04-08 10:17:51,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {177910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177910#true} is VALID [2022-04-08 10:17:51,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {177910#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:51,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:17:51,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:17:51,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:17:51,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:17:51,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:17:51,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:17:51,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:17:51,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:51,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {177911#false} assume !(~z~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {177911#false} assume !(~y~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:51,794 INFO L272 TraceCheckUtils]: 37: Hoare triple {177911#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177911#false} is VALID [2022-04-08 10:17:51,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {177911#false} ~cond := #in~cond; {177911#false} is VALID [2022-04-08 10:17:51,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {177911#false} assume 0 == ~cond; {177911#false} is VALID [2022-04-08 10:17:51,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {177911#false} assume !false; {177911#false} is VALID [2022-04-08 10:17:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:17:51,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {177911#false} assume !false; {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {177911#false} assume 0 == ~cond; {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {177911#false} ~cond := #in~cond; {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L272 TraceCheckUtils]: 37: Hoare triple {177911#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {177911#false} assume !(~y~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {177911#false} assume !(~z~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:52,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:52,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:52,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:52,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {177911#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {177911#false} is VALID [2022-04-08 10:17:52,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177911#false} is VALID [2022-04-08 10:17:52,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177993#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:52,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:17:52,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:17:52,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:17:52,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:17:52,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177968#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:17:52,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177964#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177960#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:17:52,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177956#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:17:52,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177952#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:17:52,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {177910#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177915#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:17:52,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {177910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177910#true} is VALID [2022-04-08 10:17:52,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {177910#true} call #t~ret17 := main(); {177910#true} is VALID [2022-04-08 10:17:52,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177910#true} {177910#true} #94#return; {177910#true} is VALID [2022-04-08 10:17:52,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {177910#true} assume true; {177910#true} is VALID [2022-04-08 10:17:52,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {177910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177910#true} is VALID [2022-04-08 10:17:52,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {177910#true} call ULTIMATE.init(); {177910#true} is VALID [2022-04-08 10:17:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:17:52,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066901301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:17:52,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:17:52,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-08 10:17:52,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:17:52,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1439300985] [2022-04-08 10:17:52,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1439300985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:17:52,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:17:52,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:17:52,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893767318] [2022-04-08 10:17:52,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:17:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:17:52,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:17:52,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:52,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:52,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:17:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:17:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:17:52,100 INFO L87 Difference]: Start difference. First operand 793 states and 1061 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:17:55,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:18:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:18:12,953 INFO L93 Difference]: Finished difference Result 1620 states and 2114 transitions. [2022-04-08 10:18:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:18:12,953 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:18:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:18:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-04-08 10:18:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-04-08 10:18:12,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 126 transitions. [2022-04-08 10:18:13,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:18:13,179 INFO L225 Difference]: With dead ends: 1620 [2022-04-08 10:18:13,179 INFO L226 Difference]: Without dead ends: 1559 [2022-04-08 10:18:13,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:18:13,180 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 106 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:18:13,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 102 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 608 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 10:18:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2022-04-08 10:18:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 841. [2022-04-08 10:18:19,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:18:19,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1559 states. Second operand has 841 states, 836 states have (on average 1.3349282296650717) internal successors, (1116), 836 states have internal predecessors, (1116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:19,321 INFO L74 IsIncluded]: Start isIncluded. First operand 1559 states. Second operand has 841 states, 836 states have (on average 1.3349282296650717) internal successors, (1116), 836 states have internal predecessors, (1116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:19,322 INFO L87 Difference]: Start difference. First operand 1559 states. Second operand has 841 states, 836 states have (on average 1.3349282296650717) internal successors, (1116), 836 states have internal predecessors, (1116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:18:19,384 INFO L93 Difference]: Finished difference Result 1559 states and 2028 transitions. [2022-04-08 10:18:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2028 transitions. [2022-04-08 10:18:19,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:18:19,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:18:19,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 836 states have (on average 1.3349282296650717) internal successors, (1116), 836 states have internal predecessors, (1116), 3 states have call successors, (3), 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 1559 states. [2022-04-08 10:18:19,385 INFO L87 Difference]: Start difference. First operand has 841 states, 836 states have (on average 1.3349282296650717) internal successors, (1116), 836 states have internal predecessors, (1116), 3 states have call successors, (3), 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 1559 states. [2022-04-08 10:18:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:18:19,447 INFO L93 Difference]: Finished difference Result 1559 states and 2028 transitions. [2022-04-08 10:18:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2028 transitions. [2022-04-08 10:18:19,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:18:19,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:18:19,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:18:19,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:18:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 836 states have (on average 1.3349282296650717) internal successors, (1116), 836 states have internal predecessors, (1116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1120 transitions. [2022-04-08 10:18:19,475 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1120 transitions. Word has length 41 [2022-04-08 10:18:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:18:19,476 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1120 transitions. [2022-04-08 10:18:19,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:19,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1120 transitions. [2022-04-08 10:18:25,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1120 edges. 1120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:18:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1120 transitions. [2022-04-08 10:18:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:18:25,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:18:25,259 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:18:25,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-08 10:18:25,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:18:25,459 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:18:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:18:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1748008089, now seen corresponding path program 29 times [2022-04-08 10:18:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:18:25,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432888218] [2022-04-08 10:18:25,462 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:18:25,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:18:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1748008089, now seen corresponding path program 30 times [2022-04-08 10:18:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:18:25,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123732787] [2022-04-08 10:18:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:18:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:18:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:18:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:18:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:18:25,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {186267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186243#true} is VALID [2022-04-08 10:18:25,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {186243#true} assume true; {186243#true} is VALID [2022-04-08 10:18:25,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186243#true} {186243#true} #94#return; {186243#true} is VALID [2022-04-08 10:18:25,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {186243#true} call ULTIMATE.init(); {186267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:18:25,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {186267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186243#true} is VALID [2022-04-08 10:18:25,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {186243#true} assume true; {186243#true} is VALID [2022-04-08 10:18:25,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186243#true} {186243#true} #94#return; {186243#true} is VALID [2022-04-08 10:18:25,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {186243#true} call #t~ret17 := main(); {186243#true} is VALID [2022-04-08 10:18:25,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {186243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {186248#(= main_~y~0 0)} is VALID [2022-04-08 10:18:25,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {186248#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:18:25,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {186249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:18:25,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {186250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:18:25,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {186251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:18:25,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {186252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:18:25,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {186253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186254#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:18:25,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {186254#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186255#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:18:25,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {186255#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186256#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:18:25,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {186256#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {186256#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:18:25,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {186256#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {186257#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:18:25,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {186257#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186258#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:18:25,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {186258#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186259#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:18:25,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {186259#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:18:25,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {186260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186261#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:18:25,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {186261#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:18:25,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {186262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186263#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:18:25,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {186263#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186264#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:18:25,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {186264#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186265#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:18:25,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {186265#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {186265#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:18:25,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {186265#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186264#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:18:25,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {186264#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186263#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:18:25,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {186263#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:18:25,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {186262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186261#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:18:25,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {186261#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:18:25,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {186260#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186259#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:18:25,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {186259#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186258#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:18:25,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {186258#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186266#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:18:25,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {186266#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {186266#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:18:25,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {186266#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {186266#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:18:25,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {186266#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:25,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {186244#false} assume !(~y~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:25,818 INFO L272 TraceCheckUtils]: 37: Hoare triple {186244#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186244#false} is VALID [2022-04-08 10:18:25,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {186244#false} ~cond := #in~cond; {186244#false} is VALID [2022-04-08 10:18:25,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {186244#false} assume 0 == ~cond; {186244#false} is VALID [2022-04-08 10:18:25,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {186244#false} assume !false; {186244#false} is VALID [2022-04-08 10:18:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:18:25,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:18:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123732787] [2022-04-08 10:18:25,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123732787] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:18:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055033318] [2022-04-08 10:18:25,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:18:25,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:18:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:18:25,819 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:18:25,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-08 10:18:25,927 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:18:25,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:18:25,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:18:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:18:25,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:18:26,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {186243#true} call ULTIMATE.init(); {186243#true} is VALID [2022-04-08 10:18:26,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {186243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186243#true} is VALID [2022-04-08 10:18:26,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {186243#true} assume true; {186243#true} is VALID [2022-04-08 10:18:26,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186243#true} {186243#true} #94#return; {186243#true} is VALID [2022-04-08 10:18:26,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {186243#true} call #t~ret17 := main(); {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {186243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {186243#true} assume !(~x~0 % 4294967296 > 0); {186313#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:18:26,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {186313#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {186313#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:18:26,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {186313#(not (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186320#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:18:26,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {186320#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186324#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:18:26,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {186324#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186328#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:18:26,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {186328#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186332#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {186332#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186336#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {186336#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186340#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {186340#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186344#(not (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:18:26,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {186344#(not (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:18:26,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {186348#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:26,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {186244#false} assume !(~z~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:26,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {186244#false} assume !(~y~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:26,330 INFO L272 TraceCheckUtils]: 37: Hoare triple {186244#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186244#false} is VALID [2022-04-08 10:18:26,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {186244#false} ~cond := #in~cond; {186244#false} is VALID [2022-04-08 10:18:26,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {186244#false} assume 0 == ~cond; {186244#false} is VALID [2022-04-08 10:18:26,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {186244#false} assume !false; {186244#false} is VALID [2022-04-08 10:18:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:18:26,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:18:26,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {186244#false} assume !false; {186244#false} is VALID [2022-04-08 10:18:26,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {186244#false} assume 0 == ~cond; {186244#false} is VALID [2022-04-08 10:18:26,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {186244#false} ~cond := #in~cond; {186244#false} is VALID [2022-04-08 10:18:26,694 INFO L272 TraceCheckUtils]: 37: Hoare triple {186244#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186244#false} is VALID [2022-04-08 10:18:26,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {186244#false} assume !(~y~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:26,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {186244#false} assume !(~z~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:26,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {186244#false} is VALID [2022-04-08 10:18:26,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {186418#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {186452#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186418#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:18:26,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {186456#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186452#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:18:26,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {186460#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186456#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:18:26,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {186464#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186460#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-08 10:18:26,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {186468#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186464#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:18:26,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {186472#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186468#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:18:26,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {186476#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186472#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:18:26,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {186480#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186476#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:18:26,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {186480#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {186480#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {186243#true} assume !(~x~0 % 4294967296 > 0); {186480#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {186243#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {186243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {186243#true} is VALID [2022-04-08 10:18:26,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {186243#true} call #t~ret17 := main(); {186243#true} is VALID [2022-04-08 10:18:26,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186243#true} {186243#true} #94#return; {186243#true} is VALID [2022-04-08 10:18:26,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {186243#true} assume true; {186243#true} is VALID [2022-04-08 10:18:26,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {186243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186243#true} is VALID [2022-04-08 10:18:26,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {186243#true} call ULTIMATE.init(); {186243#true} is VALID [2022-04-08 10:18:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:18:26,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055033318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:18:26,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:18:26,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 40 [2022-04-08 10:18:26,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:18:26,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432888218] [2022-04-08 10:18:26,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432888218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:18:26,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:18:26,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:18:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001426352] [2022-04-08 10:18:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:18:26,705 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:18:26,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:18:26,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:26,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:18:26,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:18:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:18:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:18:26,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1402, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:18:26,734 INFO L87 Difference]: Start difference. First operand 841 states and 1120 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:18:53,627 INFO L93 Difference]: Finished difference Result 1414 states and 2004 transitions. [2022-04-08 10:18:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-04-08 10:18:53,627 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:18:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:18:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 475 transitions. [2022-04-08 10:18:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:18:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 475 transitions. [2022-04-08 10:18:53,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 475 transitions. [2022-04-08 10:18:54,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:18:54,091 INFO L225 Difference]: With dead ends: 1414 [2022-04-08 10:18:54,091 INFO L226 Difference]: Without dead ends: 1324 [2022-04-08 10:18:54,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4878 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=821, Invalid=18639, Unknown=0, NotChecked=0, Total=19460 [2022-04-08 10:18:54,093 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 178 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5485 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 5994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 5485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:18:54,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 151 Invalid, 5994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 5485 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 10:18:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-04-08 10:19:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 900. [2022-04-08 10:19:01,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:19:01,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1324 states. Second operand has 900 states, 895 states have (on average 1.3396648044692738) internal successors, (1199), 895 states have internal predecessors, (1199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:01,246 INFO L74 IsIncluded]: Start isIncluded. First operand 1324 states. Second operand has 900 states, 895 states have (on average 1.3396648044692738) internal successors, (1199), 895 states have internal predecessors, (1199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:01,246 INFO L87 Difference]: Start difference. First operand 1324 states. Second operand has 900 states, 895 states have (on average 1.3396648044692738) internal successors, (1199), 895 states have internal predecessors, (1199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:19:01,287 INFO L93 Difference]: Finished difference Result 1324 states and 1637 transitions. [2022-04-08 10:19:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1637 transitions. [2022-04-08 10:19:01,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:19:01,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:19:01,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 900 states, 895 states have (on average 1.3396648044692738) internal successors, (1199), 895 states have internal predecessors, (1199), 3 states have call successors, (3), 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 1324 states. [2022-04-08 10:19:01,289 INFO L87 Difference]: Start difference. First operand has 900 states, 895 states have (on average 1.3396648044692738) internal successors, (1199), 895 states have internal predecessors, (1199), 3 states have call successors, (3), 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 1324 states. [2022-04-08 10:19:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:19:01,330 INFO L93 Difference]: Finished difference Result 1324 states and 1637 transitions. [2022-04-08 10:19:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1637 transitions. [2022-04-08 10:19:01,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:19:01,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:19:01,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:19:01,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:19:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 895 states have (on average 1.3396648044692738) internal successors, (1199), 895 states have internal predecessors, (1199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1203 transitions. [2022-04-08 10:19:01,366 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1203 transitions. Word has length 41 [2022-04-08 10:19:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:19:01,366 INFO L478 AbstractCegarLoop]: Abstraction has 900 states and 1203 transitions. [2022-04-08 10:19:01,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:01,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 900 states and 1203 transitions. [2022-04-08 10:19:09,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1203 edges. 1203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:19:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1203 transitions. [2022-04-08 10:19:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:19:09,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:19:09,478 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:19:09,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-08 10:19:09,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:19:09,687 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:19:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:19:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 30999719, now seen corresponding path program 19 times [2022-04-08 10:19:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:19:09,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1904904947] [2022-04-08 10:19:09,690 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:19:09,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:19:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash 30999719, now seen corresponding path program 20 times [2022-04-08 10:19:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:19:09,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634087005] [2022-04-08 10:19:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:19:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:19:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:19:09,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:19:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:19:09,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {194025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194007#true} is VALID [2022-04-08 10:19:09,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {194007#true} assume true; {194007#true} is VALID [2022-04-08 10:19:09,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194007#true} {194007#true} #94#return; {194007#true} is VALID [2022-04-08 10:19:09,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {194007#true} call ULTIMATE.init(); {194025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:19:09,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {194025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194007#true} is VALID [2022-04-08 10:19:09,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {194007#true} assume true; {194007#true} is VALID [2022-04-08 10:19:09,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194007#true} {194007#true} #94#return; {194007#true} is VALID [2022-04-08 10:19:09,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {194007#true} call #t~ret17 := main(); {194007#true} is VALID [2022-04-08 10:19:09,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {194007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {194012#(= main_~y~0 0)} is VALID [2022-04-08 10:19:09,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {194012#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:19:09,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {194013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:19:09,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {194014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:19:09,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {194015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:19:09,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {194016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:19:09,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {194017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:19:09,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {194018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:19:09,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {194019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:19:09,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {194020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:19:09,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:19:09,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {194022#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:19:09,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {194022#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {194023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {194023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {194024#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {194024#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {194008#false} assume !(~y~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {194008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {194008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {194008#false} assume !(~x~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {194008#false} assume !(~z~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {194008#false} assume !(~y~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L272 TraceCheckUtils]: 37: Hoare triple {194008#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {194008#false} ~cond := #in~cond; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {194008#false} assume 0 == ~cond; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {194008#false} assume !false; {194008#false} is VALID [2022-04-08 10:19:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-08 10:19:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:19:09,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634087005] [2022-04-08 10:19:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634087005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:19:09,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038812316] [2022-04-08 10:19:09,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:19:09,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:19:09,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:19:09,888 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:19:09,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-08 10:19:09,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:19:09,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:19:09,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:19:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:19:09,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:19:10,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {194007#true} call ULTIMATE.init(); {194007#true} is VALID [2022-04-08 10:19:10,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {194007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194007#true} is VALID [2022-04-08 10:19:10,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {194007#true} assume true; {194007#true} is VALID [2022-04-08 10:19:10,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194007#true} {194007#true} #94#return; {194007#true} is VALID [2022-04-08 10:19:10,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {194007#true} call #t~ret17 := main(); {194007#true} is VALID [2022-04-08 10:19:10,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {194007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {194012#(= main_~y~0 0)} is VALID [2022-04-08 10:19:10,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {194012#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:19:10,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {194013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:19:10,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {194014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:19:10,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {194015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:19:10,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {194016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:19:10,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {194017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:19:10,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {194018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:19:10,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {194019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:19:10,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {194020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:19:10,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:19:10,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {194021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {194022#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:19:10,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {194022#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {194023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:19:10,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {194023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {194083#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:19:10,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {194083#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {194083#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:19:10,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {194083#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:19:10,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {194023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194022#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:19:10,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {194022#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194096#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:19:10,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {194096#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194100#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:19:10,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {194100#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194104#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:19:10,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {194104#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:19:10,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {194108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194112#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:19:10,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {194112#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194116#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:19:10,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {194116#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:19:10,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~y~0 % 4294967296 > 0); {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:19:10,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:19:10,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:19:10,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~x~0 % 4294967296 > 0); {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:19:10,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {194120#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:10,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {194008#false} is VALID [2022-04-08 10:19:10,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {194008#false} is VALID [2022-04-08 10:19:10,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {194008#false} assume !(~y~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:10,364 INFO L272 TraceCheckUtils]: 37: Hoare triple {194008#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {194008#false} is VALID [2022-04-08 10:19:10,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {194008#false} ~cond := #in~cond; {194008#false} is VALID [2022-04-08 10:19:10,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {194008#false} assume 0 == ~cond; {194008#false} is VALID [2022-04-08 10:19:10,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {194008#false} assume !false; {194008#false} is VALID [2022-04-08 10:19:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:19:10,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:19:10,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {194008#false} assume !false; {194008#false} is VALID [2022-04-08 10:19:10,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {194008#false} assume 0 == ~cond; {194008#false} is VALID [2022-04-08 10:19:10,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {194008#false} ~cond := #in~cond; {194008#false} is VALID [2022-04-08 10:19:10,924 INFO L272 TraceCheckUtils]: 37: Hoare triple {194008#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {194008#false} is VALID [2022-04-08 10:19:10,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {194008#false} assume !(~y~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:10,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {194008#false} is VALID [2022-04-08 10:19:10,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {194008#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {194008#false} is VALID [2022-04-08 10:19:10,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {194178#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {194008#false} is VALID [2022-04-08 10:19:10,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {194178#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {194178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:19:10,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {194178#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {194178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:19:10,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {194178#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {194178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:19:10,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {194178#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {194178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:19:10,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {194194#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:19:10,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {194198#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194194#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-08 10:19:10,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {194202#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194198#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-08 10:19:10,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {194206#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194202#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-08 10:19:10,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {194210#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194206#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-08 10:19:10,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {194214#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194210#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-08 10:19:10,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {194218#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194214#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-08 10:19:10,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {194222#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194218#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:19:10,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {194226#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {194222#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:19:10,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {194226#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {194226#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:19:10,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {194222#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {194226#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-08 10:19:10,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {194218#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {194222#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-08 10:19:10,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {194239#(< 0 (mod (+ 7 main_~y~0) 4294967296))} ~z~0 := ~y~0; {194218#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-08 10:19:10,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {194239#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {194239#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:19:10,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {194246#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194239#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:19:10,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {194250#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194246#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:19:10,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {194254#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194250#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:19:10,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {194258#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194254#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:19:10,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {194262#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194258#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:19:10,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {194266#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194262#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:19:10,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {194270#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194266#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:19:10,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {194274#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194270#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:19:10,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {194278#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {194274#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:19:10,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {194007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {194278#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:19:10,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {194007#true} call #t~ret17 := main(); {194007#true} is VALID [2022-04-08 10:19:10,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194007#true} {194007#true} #94#return; {194007#true} is VALID [2022-04-08 10:19:10,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {194007#true} assume true; {194007#true} is VALID [2022-04-08 10:19:10,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {194007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194007#true} is VALID [2022-04-08 10:19:10,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {194007#true} call ULTIMATE.init(); {194007#true} is VALID [2022-04-08 10:19:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:19:10,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038812316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:19:10,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:19:10,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 22] total 44 [2022-04-08 10:19:10,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:19:10,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1904904947] [2022-04-08 10:19:10,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1904904947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:19:10,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:19:10,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:19:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417519544] [2022-04-08 10:19:10,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:19:10,941 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:19:10,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:19:10,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:10,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:19:10,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:19:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:19:10,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:19:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:19:10,960 INFO L87 Difference]: Start difference. First operand 900 states and 1203 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:19:21,058 INFO L93 Difference]: Finished difference Result 1022 states and 1345 transitions. [2022-04-08 10:19:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:19:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 10:19:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:19:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 137 transitions. [2022-04-08 10:19:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 137 transitions. [2022-04-08 10:19:21,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 137 transitions. [2022-04-08 10:19:21,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:19:21,200 INFO L225 Difference]: With dead ends: 1022 [2022-04-08 10:19:21,200 INFO L226 Difference]: Without dead ends: 1000 [2022-04-08 10:19:21,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=571, Invalid=2969, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:19:21,201 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 111 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:19:21,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 124 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:19:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-04-08 10:19:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 900. [2022-04-08 10:19:28,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:19:28,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1000 states. Second operand has 900 states, 895 states have (on average 1.3385474860335196) internal successors, (1198), 895 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:28,413 INFO L74 IsIncluded]: Start isIncluded. First operand 1000 states. Second operand has 900 states, 895 states have (on average 1.3385474860335196) internal successors, (1198), 895 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:28,414 INFO L87 Difference]: Start difference. First operand 1000 states. Second operand has 900 states, 895 states have (on average 1.3385474860335196) internal successors, (1198), 895 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:19:28,439 INFO L93 Difference]: Finished difference Result 1000 states and 1322 transitions. [2022-04-08 10:19:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1322 transitions. [2022-04-08 10:19:28,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:19:28,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:19:28,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 900 states, 895 states have (on average 1.3385474860335196) internal successors, (1198), 895 states have internal predecessors, (1198), 3 states have call successors, (3), 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 1000 states. [2022-04-08 10:19:28,441 INFO L87 Difference]: Start difference. First operand has 900 states, 895 states have (on average 1.3385474860335196) internal successors, (1198), 895 states have internal predecessors, (1198), 3 states have call successors, (3), 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 1000 states. [2022-04-08 10:19:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:19:28,466 INFO L93 Difference]: Finished difference Result 1000 states and 1322 transitions. [2022-04-08 10:19:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1322 transitions. [2022-04-08 10:19:28,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:19:28,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:19:28,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:19:28,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:19:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 895 states have (on average 1.3385474860335196) internal successors, (1198), 895 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1202 transitions. [2022-04-08 10:19:28,499 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1202 transitions. Word has length 41 [2022-04-08 10:19:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:19:28,500 INFO L478 AbstractCegarLoop]: Abstraction has 900 states and 1202 transitions. [2022-04-08 10:19:28,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:19:28,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 900 states and 1202 transitions.